Skip to main content
SpringerLink
Log in

Programmation en nombres entiers

  • Chapter
Optimisation combinatoire

Part of the book series: Collection IRIS ((IRIS))

  • 651 Accesses

Résumé

Le probléme de la programmation en nombres entiers se formule ainsi:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

Littérature générale

  • Bertsimas, D., Weismantel, R. [2005]: Optimization Over Integers. Dynamic Ideas, Belmont 2005

    Google Scholar 

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A. [1998]: Combinatorial Optimization. Wiley, New York 1998, Chapter 6

    MATH  Google Scholar 

  • Nemhauser, G.L., Wolsey, L.A. [1988]: Integer and Combinatorial Optimization. Wiley, New York 1988

    MATH  Google Scholar 

  • Schrijver, A. [1986]: Theory of Linear and Integer Programming. Wiley, Chichester 1986

    MATH  Google Scholar 

  • Wolsey, L.A. [1998]: Integer Programming. Wiley, New York 1998

    MATH  Google Scholar 

Références citées

  • Boyd, E.A. [1997]: A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball. Operations Research Letters 20 (1997), 59–63

    Article  MATH  MathSciNet  Google Scholar 

  • Bruns, W., Gubeladze, J., Henk, M., Martin, A., Weismantel, R. [1999]: A counterexample to an integral analogue of Carathéodory’s theorem. Journal für die Reine und Angewandte Mathematik 510 (1999), 179–185

    Article  MATH  MathSciNet  Google Scholar 

  • Chvátal, V. [1973]: Edmonds’ polytopes and a hierarchy of combinatorial problems. Discrete Mathematics 4 (1973), 305–337

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, W. [1983]: Operations that preserve total dual integrality. Operations Research Letters 2 (1983), 31–35

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, W., Fonlupt, J., Schrijver, A. [1986]: An integer analogue of Carathéodory’s theorem. Journal of Combinatorial Theory B 40 (1986), 63–70

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, W., Gerards, A., Schrijver, A., Tardos, É. [1986]: Sensitivity theorems in integer linear programming. Mathematical Programming 34 (1986), 251–264

    Article  MATH  MathSciNet  Google Scholar 

  • Cook, W., Kannan, R., Schrijver, A. [1990]: Chvátal closures for mixed integer programming problems. Mathematical Programming 47 (1990), 155–174

    Article  MATH  MathSciNet  Google Scholar 

  • Dantzig, G., Fulkerson, R., Johnson, S. [1954]: Solution of a large-scale traveling-salesman problem. Operations Research 2 (1954), 393–410

    Article  MathSciNet  Google Scholar 

  • Edmonds, J., Giles, R. [1977]: A min-max relation for submodular functions on graphs. In: Studies in Integer Programming; Annals of Discrete Mathematics 1 (P.L. Hammer, E.L. Johnson, B.H. Korte, G.L. Nemhauser, eds.), North-Holland, Amsterdam 1977, pp. 185–204

    Google Scholar 

  • Eisenbrand, F. [1999]: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19 (1999), 297–300

    Article  MATH  MathSciNet  Google Scholar 

  • Eisenbrand, F., Schulz, A.S. [2003]: Bounds on the Chvátal rank of polytopes in the 0/1-cube. Combinatorica 23 (2003), 245–261

    Article  MATH  MathSciNet  Google Scholar 

  • Fulkerson, D.R. [1971]: Blocking and anti-blocking pairs of polyhedra. Mathematical Programming 1 (1971), 168–194

    Article  MATH  MathSciNet  Google Scholar 

  • Geoffrion, A.M. [1974]: Lagrangean relaxation for integer programming. Mathematical Programming Study 2 (1974), 82–114

    MathSciNet  Google Scholar 

  • Giles, F.R., Pulleyblank, W.R. [1979]: Total dual integrality and integer polyhedra. Linear Algebra and Its Applications 25 (1979), 191–196

    Article  MATH  MathSciNet  Google Scholar 

  • Ghouila-Houri, A. [1962]: Caractérisation des matrices totalement unimodulaires. Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences (Paris) 254 (1962), 1192–1194

    MATH  MathSciNet  Google Scholar 

  • Goemans, M.X., Skutella, M. [2004]: Cooperative facility location games. Journal of Algorithms 50 (2004), 194–214

    Article  MATH  Google Scholar 

  • Goffin, J.L. [1977]: On convergence rates of subgradient optimization methods. Mathematical Programming 13 (1977), 329–347

    Article  MATH  MathSciNet  Google Scholar 

  • Gomory, R.E. [1958]: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64 (1958), 275–278

    Article  MATH  MathSciNet  Google Scholar 

  • Gomory, R.E. [1963]: An algorithm for integer solutions of linear programs. In: Recent Advances in Mathematical Programming (R.L. Graves, P. Wolfe, eds.), McGraw-Hill, New York, 1963, pp. 269–302

    Google Scholar 

  • Graver, J.E. [1975]: On the foundations of linear and integer programming I. Mathematical Programming 9 (1975), 207–226

    Article  MATH  MathSciNet  Google Scholar 

  • Harvey, W. [1999]: Computing two-dimensional integer hulls. SIAM Journal on Computing 28 (1999), 2285–2299

    Article  MATH  MathSciNet  Google Scholar 

  • Hochbaum, D.S., Levin, A. [2006]: Optimizing over consecutive 1’s and circular 1’s constraints. SIAM Journal on Optimization 17 (2006), 311–330

    Article  MATH  MathSciNet  Google Scholar 

  • Hoffman, A.J. [1974]: A generalization of max flow-min cut. Mathematical Programming 6 (1974), 352–359

    Article  MATH  MathSciNet  Google Scholar 

  • Hoffman, A.J., Kruskal, J.B. [1956]: Integral boundary points of convex polyhedra. In: Linear Inequalities and Related Systems; Annals of Mathematical Study 38 (H.W. Kuhn, A.W. Tucker, eds.), Princeton University Press, Princeton 1956, 223–246

    Google Scholar 

  • Lasserre, J.B. [2004]: The integer hull of a convex rational polytope. Discrete & Computational Geometry 32 (2004), 129–139

    Article  MATH  MathSciNet  Google Scholar 

  • Meyer, R.R. [1974]: On the existence of optimal solutions to integer and mixed-integer programming problems. Mathematical Programming 7 (1974), 223–235

    Article  MATH  MathSciNet  Google Scholar 

  • Polyak, B.T. [1967]: A general method for solving extremal problems. Doklady Akademii Nauk SSSR 174 (1967), 33–36 [in Russian]. English translation: Soviet Mathematics Doklady 8 (1967), 593–597

    MathSciNet  Google Scholar 

  • Schrijver, A. [1980]: On cutting planes. In: Combinatorics 79; Part II; Annals of Discrete Mathematics 9 (M. Deza, I.G. Rosenberg, eds.), North-Holland, Amsterdam 1980, pp. 291–296

    Google Scholar 

  • Schrijver, A. [1981]: On total dual integrality. Linear Algebra and its Applications 38 (1981), 27–32

    Article  MATH  MathSciNet  Google Scholar 

  • Schrijver, A. [1983]: Packing and covering of crossing families of cuts. Journal of Combinatorial Theory B 35 (1983), 104–128

    Article  MATH  MathSciNet  Google Scholar 

  • Sebő, A. [1990]: Hilbert bases, Carathéodory’s theorem and combinatorial optimization. In: Integer Programming and Combinatorial Optimization (R. Kannan and W.R. Pulleyblank, eds.), University of Waterloo Press, 1990

    Google Scholar 

  • Seymour, P.D. [1980]: Decomposition of regular matroids. Journal of Combinatorial Theory B 28 (1980), 305–359

    Article  MATH  MathSciNet  Google Scholar 

  • Veinott, A.F., Jr., Dantzig, G.B. [1968]. Integral extreme points. SIAM Review 10 (1968), 371–372

    Article  MATH  MathSciNet  Google Scholar 

  • Wolsey, L.A. [1981]: The b-hull of an integer program. Discrete Applied Mathematics 3 (1981), 193–201

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Discrete Mathematics, University of Bonn, Lennéstraße 2, 53113, Bonn, Germany

    Bernhard Korte & Jens Vygen

  2. Faculté de mathématiques, Université Paris-VI, 175, rue du Chevaleret, 75013, Paris

    Jean Fonlupt (Professeur émérite)

  3. Panthéon-Sorbonne Centre d’économie de la Sorbonne, Université Paris-I, 106-112, boulevard de l’Hôpital, 75013, Paris

    Alexandre Skoda

Authors
  1. Bernhard Korte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jens Vygen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean Fonlupt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexandre Skoda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag France

About this chapter

Cite this chapter

Korte, B., Vygen, J., Fonlupt, J., Skoda, A. (2010). Programmation en nombres entiers. In: Optimisation combinatoire. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-287-99037-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-2-287-99037-3_5

  • Publisher Name: Springer, Paris

  • Print ISBN: 978-2-287-99036-6

  • Online ISBN: 978-2-287-99037-3

Publish with us

Policies and ethics

Search

Navigation