.. Mise-en-oeuvre-de-la-méthode-exacte, 28 3.4.1 Solution admissible, p.29

D. Quadri, Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem, Soutif (30%), pp.299-314, 2007.
DOI : 10.1007/BF02942392
URL : https://hal.archives-ouvertes.fr/hal-00178949

D. Quadri, Upper bounds for large scale integer quadratic multidimensional knapsack, Soutif (25%) and P. Tolla (5%), pp.146-154, 2007.
DOI : 10.1007/s10878-007-9105-1
URL : https://hal.archives-ouvertes.fr/hal-01125250

A. Soumis, D. K. Une-revue-internationale-1, S. Yang, D. Martin, J. Quadri et al., Energy-Efficient Downlink Resource Allocation, LTE Heterogeneous Networks

T. Garaix, D. Feillet, D. Quadri, F. Lehuede, and O. Peton, A branch-and-price algorithm for the Consistent Vehicle Routing Problem CONFÉRENCESCONF´ CONFÉRENCES INTERNATIONALES AVEC ACTES 1, Brotcorne : Mathematical Programming with Stochastic Equilibrium Constraints applied to Last-mile Delivery Services, International Network Optimization Conference, 2015.

B. Tousni, Y. Hayel, D. Quadri, and L. Brotcorne, Last-mile delivery services design under stochastic user, INFORMS Transportation Science and Logistics Society Workshop, 2015.

Y. Hayel, D. Quadri, T. Jimenez, and L. , Brotcorne A Game Theoretical Model for Freight Transportation invited paper, International Conference on Analytic and Stochastic Modelling Techniques and Applications (ASMTA), p.2012

N. Camelin, B. Detienne, S. Huet, D. Quadri, and F. Lefevre, Unsupervised Concept Annotation using Latent Dirichlet Allocation and Segmental Methods, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01314555

N. Camelin, B. Detienne, S. Huet, D. Quadri, and F. Lefevre, Concept Discovery for Language Understanding in an Information-Query Dialogue, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01314539

C. Rodrigues, D. Quadri, P. Michelon, and S. Gueye, A t-linearization to exactly solve 0-1 quadratic knapsack problems, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01320150

P. Michelon, D. Quadri, and M. Neigreiros, On a class of periodic scheduling problems: Models, lower bounds and heuristics, 2008 International Multiconference on Computer Science and Information Technology, pp.899-906, 2008.
DOI : 10.1109/IMCSIT.2008.4747349
URL : https://hal.archives-ouvertes.fr/hal-01318570

D. Quadri, E. Soutif, and P. Tolla, A branch-and-bound algorithm to solve large scale integer quadratic multidimensional knapsack problems, LNCS, vol.4362, pp.456-464, 2007.
DOI : 10.1007/978-3-540-69507-3_39

C. D. De-livres-1, E. Quadri, P. Soutif, and . Tolla, Integer quadratic knapsack problems, chapter 9 of Combinatorial Optimization and Theoretical Computer Science, pp.267-295, 2010.

D. Quadri, E. Soutif, and P. Tolla, An Upper Bound for the Integer Quadratic Multi-knapsack Problem, chapter 19 of Combinatorial optimization -Theoretical computer science : interfaces and perspectives, pp.495-505, 2008.

D. Quadri, E. Soutif, and P. Tolla, Lesprobì emes de sac-` a-dos quadratiques en variablesentì eres, Optimisation combinatoire, Hermès-Sciences, vol.4, pp.191-211, 2007.

D. Quadri, E. Soutif, and P. Tolla, Programmation Quadratique en Entiers : un majorant pour le multisac-` a-dos quadratique séparable entier, Annales du Lamsade, issue.4, pp.411-422, 2007.

G. S. Lueker, Two np-complete problems in nonnegative integer programming, 1975.

P. Chaillou, P. Hansen, and Y. Mathieu, Best network flow bounds for the quadratic knapsack problem, Lecture Notes in Mathematics, vol.5, pp.226-235, 1986.
DOI : 10.1002/net.3230050405

S. Martello and P. Toth, Knapsack Problems : Algorithms and Computer Implementations, 1990.

M. Weingartner, Capital Budgeting of Interrelated Projects: Survey and Synthesis, Management Science, vol.12, issue.7, pp.485-516, 1966.
DOI : 10.1287/mnsc.12.7.485

T. L. Morin and R. E. Martsen, Branch-and-Bound Strategies for Dynamic Programming, Operations Research, vol.24, issue.4, pp.611-627, 1976.
DOI : 10.1287/opre.24.4.611
URL : http://dspace.mit.edu/bitstream/1721.1/46916/1/branchandboundstx00mori.pdf

T. L. Morin and R. E. Martsen, An Algorithm for Nonlinear Knapsack Problems, Management Science, vol.22, issue.10, pp.1147-1158, 1976.
DOI : 10.1287/mnsc.22.10.1147

B. Faaland, An Integer Programming Algorithm for Portfolio Selection, Management Science, vol.20, issue.10, pp.1376-1384, 1974.
DOI : 10.1287/mnsc.20.10.1376

H. M. Markowitz, Portfolio selection, Journal of Finance, vol.7, issue.1, pp.77-91, 1952.

D. Li, X. L. Sun, and J. Wang, OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN-VARIANCE FORMULATION FOR PORTFOLIO SELECTION, Mathematical Finance, vol.44, issue.1, pp.83-101, 2006.
DOI : 10.1007/s002450010003

T. Van-zandt, Heuristic and exact solution method for convex nonlinear knapsack problem, CEPR Discussion Pape, vol.4022, 2003.

M. Plateau and Y. , Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, European Journal of Operational Research, vol.201, issue.3, pp.729-736, 2010.
DOI : 10.1016/j.ejor.2009.03.049

M. Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, Journal of the ACM, vol.48, issue.2, pp.206-242, 2001.
DOI : 10.1145/375827.375840
URL : http://www.core.ucl.ac.be/services/psfiles/dp9963.pdf

W. D. Pisinger, The quadratic knapsack problem???a survey, Discrete Applied Mathematics, vol.155, issue.5, pp.623-648, 2007.
DOI : 10.1016/j.dam.2006.08.007
URL : https://doi.org/10.1016/j.dam.2006.08.007

G. Gallo, P. L. Hammer, and B. Simeone, Quadratic knapsack problems, Mathematical Programming Study, vol.12, pp.132-149, 1980.
DOI : 10.1007/BFb0120892

A. Caprara, D. Pisinger, and P. Toth, Exact Solution of the Quadratic Knapsack Problem, INFORMS Journal on Computing, vol.11, issue.2, pp.125-137, 1999.
DOI : 10.1287/ijoc.11.2.125

P. Michelon and L. Veilleux, Lagrangean methods for the 0???1 Quadratic Knapsack Problem, European Journal of Operational Research, vol.92, issue.2, pp.326-341, 1996.
DOI : 10.1016/0377-2217(94)00286-X

A. Billionnet and E. Soutif, An exact method based on Lagrangian decomposition for the 0???1 quadratic knapsack problem, European Journal of Operational Research, vol.157, issue.3, pp.565-575, 2004.
DOI : 10.1016/S0377-2217(03)00244-3
URL : https://hal.archives-ouvertes.fr/hal-01124918

A. L. Létocart, G. Nagih, and . Plateau, Reoptimization in Lagrangian methods for the 0???1 quadratic knapsack problem, Computers & Operations Research, vol.39, issue.1, pp.12-18, 2012.
DOI : 10.1016/j.cor.2010.10.027

D. Pisinger, A. B. Rasmussen, and R. Sandvick, Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction, INFORMS Journal on Computing, vol.19, issue.2, pp.280-290, 2007.
DOI : 10.1287/ijoc.1050.0172

F. Glover, Improved Linear Integer Programming Formulations of Nonlinear Integer Problems, Management Science, vol.22, issue.4, pp.455-460, 1975.
DOI : 10.1287/mnsc.22.4.455

H. Sherali and W. Adams, A reformulation technique for solving discrete and continuous non convex problems, 1999.
DOI : 10.1007/978-1-4757-4388-3

S. Elloumi, A. Faye, and E. Soutif, Decomposition and linearization for 0-1 quadratic programming, Annals of Operations Research, vol.99, issue.1/4, pp.79-93, 2000.
DOI : 10.1023/A:1019236832495
URL : https://hal.archives-ouvertes.fr/hal-01124548

W. Chaovalitwongse, P. Pardalos, and O. A. Prokopyev, A new linearization technique for multi-quadratic 0???1 programming problems, Operations Research Letters, vol.32, issue.6, pp.517-522, 2004.
DOI : 10.1016/j.orl.2004.03.005

N. Krislock, J. Malick, and F. Roupin, Nonstandard semidefinite bounds for solving exactly 0-1 quadratic problems, EURO XXV, 2012.

F. Roupin, Algorithmes combinatoires et relaxations par programmation linéaire et semidéfinie. applicationàplication`plicationà la résolution deprobì emes quadratiques et d'optimisation dans les graphes, 2006.

E. Balas and J. B. Mazzola, Nonlinear 0???1 programming: I. Linearization techniques, Mathematical Programming, pp.1-21, 1984.
DOI : 10.1287/mnsc.18.6.B328

E. Balas and J. B. Mazzola, Nonlinear 0???1 programming: II. Dominance relations and algorithms, Mathematical Programming, pp.22-45, 1984.
DOI : 10.1287/mnsc.18.6.B328

S. Gueye and P. Michelon, ???Miniaturized??? Linearizations for Quadratic 0/1 Problems, Annals of Operations Research, vol.79, issue.1, pp.235-261, 2005.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

S. Gueye and P. Michelon, A linearization framework for unconstrained quadratic (0-1) problems, Discrete Applied Mathematics, vol.157, issue.6, pp.1255-1266, 2009.
DOI : 10.1016/j.dam.2008.01.028
URL : https://hal.archives-ouvertes.fr/hal-01317480

R. Fortet, Application de l'algèbre de boole en recherche opérationelle. Revue Française de la Recherche Opérationelle, pp.17-25, 1960.

P. Hansen and C. Meyer, Improved compact linearizations for the unconstrained quadratic 0???1 minimization problem, Discrete Applied Mathematics, vol.157, issue.6, pp.1267-1290, 2009.
DOI : 10.1016/j.dam.2007.12.008

W. P. Adams, R. J. Forrester, and F. Glover, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, Discrete Optimization, vol.1, issue.2, pp.99-120, 2004.
DOI : 10.1016/j.disopt.2004.03.006
URL : https://doi.org/10.1016/j.disopt.2004.03.006

A. Billionnet, S. Elloumi, and M. Plateau, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Discrete Applied Mathematics, vol.157, issue.6, pp.1185-1197, 2009.
DOI : 10.1016/j.dam.2007.12.007
URL : https://hal.archives-ouvertes.fr/hal-01125253

L. Liberti, Compact linearization for binary quadratic problems, 4OR, vol.68, issue.10, pp.231-245, 2007.
DOI : 10.1007/978-1-4613-1379-3

K. Bretthauer and B. Shetty, A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems, ORSA Journal on Computing, vol.7, issue.1, pp.109-116, 1995.
DOI : 10.1287/ijoc.7.1.109

M. Djerdjour, K. Mathur, and H. Salkin, A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem, Operations Research Letters, vol.7, issue.5, pp.253-257, 1988.
DOI : 10.1016/0167-6377(88)90041-7

D. Quadri, E. Soutif, and P. Tolla, Exact solution method to solve large scale integer quadratic multidimensional knapsack problems, Journal of Combinatorial Optimization, vol.4, issue.3, pp.157-167, 2009.
DOI : 10.1007/s10878-007-9105-1
URL : https://hal.archives-ouvertes.fr/hal-00917814

B. Zhang and B. Chen, HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM, Asia-Pacific Journal of Operational Research, vol.74, issue.05
DOI : 10.1016/j.ijpe.2008.10.003

Z. Hua, B. Zhang, and L. Liang, An approximate dynamic programming approach to convex quadratic knapsack problems, Computers & Operations Research, vol.33, issue.3, pp.660-673, 2006.
DOI : 10.1016/j.cor.2004.07.012

B. Zhang and Z. Hua, Simple solution methods for separable mixed linear and quadratic knapsack problem, Applied Mathematical Modelling, vol.36, issue.7, pp.3245-3526, 2012.
DOI : 10.1016/j.apm.2011.10.017
URL : https://doi.org/10.1016/j.apm.2011.10.017

M. Djerdjour, An enumerative algorithm framework for a class of nonlinear integer programming problems, European Journal of Operational Research, vol.101, issue.1, pp.104-121, 1997.
DOI : 10.1016/S0377-2217(96)00164-6

J. P. Dussault, J. A. Ferland, and B. Lemaire, Convex quadratic programming with one constraint and bounded variables, Mathematical Programming, pp.90-104, 1986.
DOI : 10.1515/9781400873173

J. J. More and S. A. Vavasis, On the solution of concave knapsack problems, Mathematical Programming, pp.397-411, 1991.
DOI : 10.1007/BF01588800

H. P. Benson, S. S. Erenguc, and R. Horst, A note on adapting methods for continuous global optimization to the discrete case, Annals of Operations Research, vol.10, issue.1, pp.243-252, 1990.
DOI : 10.1002/nav.3800260405

S. S. Erenguc and H. P. Benson, An algorithm for indefinite integer quadratic programming, Computers & Mathematics with Applications, vol.21, issue.6-7, pp.99-106, 1991.
DOI : 10.1016/0898-1221(91)90164-Y
URL : https://doi.org/10.1016/0898-1221(91)90164-y

R. Horst and H. Tuy, Global Optimization : Deterministic Approaches, 1990.

A. Billionnet, S. Elloumi, and A. Lambert, An efficient compact quadratic convex reformulation for general integer quadratic programs, Computational Optimization and Applications, vol.32, issue.10, pp.141-162, 2013.
DOI : 10.1007/978-1-4757-3532-1
URL : https://hal.archives-ouvertes.fr/hal-01126098

X. J. Zheng, X. L. Sun, and D. Li, Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach, Journal of Optimization Theory and Applications, vol.28, issue.2, pp.463-489, 2010.
DOI : 10.1017/CBO9780511810817

Z. Minjin and C. Wei, Reducing the number of variables in integer quadratic programming problem, Applied Mathematical Modelling, vol.34, pp.424-436, 2010.

O. Y. Ozaltin, O. A. Prokopyev, and A. J. Schaefer, Two-stage quadratic integer programs with stochastic right-hand sides, Mathematical Programming, vol.20, issue.2, pp.121-158, 2012.
DOI : 10.1007/BF01589344

J. H. Wilkinson, The Algebraic Eigenvalue Problem, 1965.

D. Quadri, E. Soutif, and P. Tolla, Upper bounds for large scale integer quadratic multidimensional knapsack, International Journal of Operations Research, vol.4, issue.3, pp.146-154, 2007.
DOI : 10.1007/s10878-007-9105-1
URL : https://hal.archives-ouvertes.fr/hal-01125250

P. C. Chu and J. E. Beasley, A genetic algorithm for the multidimensional knapsack problem, Journal of Heuristics, vol.4, issue.1, pp.63-86, 1998.
DOI : 10.1023/A:1009642405419

A. Billionnet, A. Faye, and E. Soutif, A new upper bound for the 0-1 quadratic knapsack problem, European Journal of Operational Research, vol.112, issue.3, pp.664-672, 1999.
DOI : 10.1016/S0377-2217(97)00414-1
URL : https://hal.archives-ouvertes.fr/hal-01124497

W. D. Pisinger, A. Rasmussen, and R. Sandvik, Solution of large quadratic knapsack problems through agressive reduction, INFORMS Journal on Computing, 2006.

A. Billionnet and F. Calmels, Linear programming for the 0???1 quadratic knapsack problem, European Journal of Operational Research, vol.92, issue.2, pp.310-325, 1996.
DOI : 10.1016/0377-2217(94)00229-0
URL : https://hal.archives-ouvertes.fr/hal-01124499

A. Caprara, D. Pisinger, and P. Toth, Exact Solution of the Quadratic Knapsack Problem, INFORMS Journal on Computing, vol.11, issue.2, pp.125-137, 1999.
DOI : 10.1287/ijoc.11.2.125

C. Oliva, P. Michelon, and C. Artigues, Constraint and linear programming : Using reduced costs for solving the zero/one multiple knapsack problem, International Conference on Constraint Programming , Proceedings of the workshop on Cooperative Solvers in Constraint Programming, pp.87-98, 2001.

E. Soutif, Expreriments for qkp. website of the CEDRIC CNAM Paris, 2001.

M. Negreiros, A. E. Xavier, A. F. Xavier, and P. Michelon, A framework of computational systems and optimization models for the prevention and combat of dengue, 17th IFORS Triennial Conference, 2005.

A. M. Campbell and J. R. Hardin, Vehicle minimization for periodic deliveries, European Journal of Operational Research, vol.165, issue.3, pp.668-684, 2005.
DOI : 10.1016/j.ejor.2003.09.036

B. O. Koopman, Search and screening, 1980.

R. Hohzaki, Search allocation game, European Journal of Operational Research, vol.172, issue.1, pp.101-119, 2006.
DOI : 10.1016/j.ejor.2004.10.003

P. Zhendong, T. Jiafu, and R. Y. Fung, Synchronization of inventory and transportation under flexible vehicle constraint : A heuristics approach using sliding windows and hierarchical tree structure, Operations Research, vol.28, issue.6, pp.1275-1289, 1980.

S. S. Brown, Optimal Search for a Moving Target in Discrete Time and Space, Operations Research, vol.28, issue.6, pp.824-836, 2009.
DOI : 10.1287/opre.28.6.1275

R. Ducret and L. Delaitre, Parcel delivery and urban logistics-changes in urban courier, express and parcel services : the french case, 13th World Conference on Transport Research, 2013.
URL : https://hal.archives-ouvertes.fr/halshs-00853932

E. Verhoef, Economic efficiency and social feasibility in the regulation of road transport externalities, 1996.

B. Colson, P. Marcotte, and G. Savard, Bilevel programming: A survey, 4OR, vol.3, issue.2, pp.87-107, 2005.
DOI : 10.1007/s10288-005-0071-0

Y. Hayel, D. Quadri, T. Jimenez, and L. Brotcorne, Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers, Annals of Operations Research, vol.21, issue.6, 2015.
DOI : 10.1680/ipeds.1952.11362
URL : https://hal.archives-ouvertes.fr/hal-01053487

M. Ben-akiva and S. Lerman, Discrete choice analysis : Theory and application to travel demand, 1985.

Y. Sheffi, Urban transportation networks : Equilibrium analysis with mathematical programming methods, 1985.

S. Anderson, A. De-palma, and J. Thissei, Discrete choice theory of product differentiation, 1992.

D. Macfadden, Quantal choice analysis : A survey, Annals of Economic and Social Measurement, vol.5, pp.363-370, 1976.

H. Yang, Sensitivity analysis for queuing equilibrium network flow and its application to traffic control, Mathematical and computer modeling, vol.22, issue.4, pp.247-258, 1995.

Y. Chen, S. Zhang, S. Xu, and G. Y. Li, Fundamental trade-offs on green wireless networks, IEEE Communications Magazine, vol.49, issue.6, pp.30-37, 2011.
DOI : 10.1109/MCOM.2011.5783982

C. Xiong, G. Y. Li, S. Zhang, Y. Chen, and S. Xu, Energy- and Spectral-Efficiency Tradeoff in Downlink OFDMA Networks, IEEE Transactions on Wireless Communications, vol.10, issue.11, pp.3874-3886, 2011.
DOI : 10.1109/TWC.2011.091411.110249

C. He, B. Sheng, P. Zhu, X. You, and G. Y. Li, Energy- and Spectral-Efficiency Tradeoff for Distributed Antenna Systems with Proportional Fairness, IEEE Journal on Selected Areas in Communications, vol.31, issue.5, pp.31894-902, 2013.
DOI : 10.1109/JSAC.2013.130508
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.352.4459&rep=rep1&type=pdf

G. Miao, N. Himayat, and G. Y. Li, Energy-efficient link adaptation in frequency-selective channels, IEEE Transactions on Communications, vol.58, issue.2, pp.545-554, 2010.
DOI : 10.1109/TCOMM.2010.02.080587

C. Isheden, Z. Chong, E. A. Jorswieck, and G. Fettweis, Framework for Link-Level Energy Efficiency Optimization with Informed Transmitter, IEEE Transactions on Wireless Communications, vol.11, issue.8, pp.2946-2957, 2012.
DOI : 10.1109/TWC.2012.060412.111829
URL : http://arxiv.org/pdf/1110.1990

W. Dinkelbach, On Nonlinear Fractional Programming, Management Science, vol.13, issue.7, pp.492-498, 1967.
DOI : 10.1287/mnsc.13.7.492

S. Burer and A. N. Letchford, Non-convex mixed-integer nonlinear programming: A survey, Surveys in Operations Research and Management Science, vol.17, issue.2, pp.97-106, 2012.
DOI : 10.1016/j.sorms.2012.08.001
URL : http://www.lancaster.ac.uk/staff/letchfoa/articles/minlp-survey.pdf

P. Bonami, L. T. Biegler, A. R. Conn, G. Cornujols, I. E. Grossmann et al., An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, pp.186-204, 2012.
DOI : 10.1016/j.disopt.2006.10.011
URL : https://hal.archives-ouvertes.fr/hal-00421753

A. Billionnet, S. Elloumi, and A. Lambert, Convex reformulations of integer quadratically constrained problems, ISMP (21th International Symposium of Mathematical programming), p.1, 2012.
DOI : 10.1007/s10107-015-0921-2
URL : https://hal.archives-ouvertes.fr/hal-01126039

K. Bretthauer and B. Shetty, Quadratic resource allocation with generalized upper bounds, Operations Research Letters, vol.20, issue.2, pp.51-57, 1997.
DOI : 10.1016/S0167-6377(96)00039-9

L. Liberti, Reformulation techniques in mathematical programming. HabilitationàHabilitation`Habilitationà Diriger des Recherches, 2007.
DOI : 10.1016/j.dam.2008.10.016
URL : https://hal.archives-ouvertes.fr/hal-00163563