IDEAS home Printed from https://ideas.repec.org/p/unm/umamet/1995014.html
   My bibliography  Save this paper

Polyhedral techniques in combinatorial optimization

Author

Listed:
  • Aardal, K.

    (Externe publicaties SBE)

  • van Hoesel, C.P.M.

    (Quantitative Economics)

Abstract

No abstract is available for this item.

Suggested Citation

  • Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    • Handle: RePEc:unm:umamet:1995014
    DOI: 10.26481/umamet.1995014
    as

    Download full text from publisher

    File URL: https://cris.maastrichtuniversity.nl/ws/files/655402/guid-588875f8-3c43-448f-92f7-54fcfa40d704-ASSET1.0.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.26481/umamet.1995014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Araque, J. & Hall, L. & Magnanti, T., 1990. "Capacitated trees, capacitated routing, and associated polyhedra," LIDAM Discussion Papers CORE 1990061, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. EDMONDS, Jack & GILES, Rick, 1977. "A min-max relation for submodular functions on graphs," LIDAM Reprints CORE 301, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Aardal, K.I., 1994. "Capacitated facility location : Separation algorithms and computational experience," Other publications TiSEM 9595443a-b1ec-4c61-8a47-d, Tilburg University, School of Economics and Management.
    4. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    5. Egon Balas & Eitan Zemel, 1977. "Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes," Mathematics of Operations Research, INFORMS, vol. 2(1), pages 15-19, February.
    6. AARDAL, Karen & POCHET, Yves & WOLSEY, Laurence A., 1993. "Capacitated Facility Location : Valid Inequalities and Facets," LIDAM Discussion Papers CORE 1993023, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. M. Grötschel & W. R. Pulleyblank, 1986. "Clique Tree Inequalities and the Symmetric Travelling Salesman Problem," Mathematics of Operations Research, INFORMS, vol. 11(4), pages 537-569, November.
    8. M. Deza & M. Grötschel & M. Laurent, 1992. "Clique-Web Facets for Multicut Polytopes," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 981-1000, November.
    9. Aardal, K., 1994. "Capacitated Facility Location: Separation Algorithms and Computational Experience," Papers 9480, Tilburg - Center for Economic Research.
    10. Leslie A. Hall & Thomas L. Magnanti, 1992. "A Polyhedral Intersection Theorem for Capacitated Spanning Trees," Mathematics of Operations Research, INFORMS, vol. 17(2), pages 398-410, May.
    11. VAN ROY, Tony J. & WOLSEY, Laurence A., 1986. "Valid inequalities for mixed 0-1 programs," LIDAM Reprints CORE 697, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Sunil Chopra & Edgar R. Gorres & M. R. Rao, 1992. "Solving the Steiner Tree Problem on a Graph Using Branch and Cut," INFORMS Journal on Computing, INFORMS, vol. 4(3), pages 320-335, August.
    13. Aardal, K. & Labbe, M. & Leung, J. & Queyranne, M., 1994. "On the Two-Level Uncapacitated Facility Location Problem," Papers 9486, Tilburg - Center for Economic Research.
    14. Egon Balas & Manfred W. Padberg, 1972. "On the Set-Covering Problem," Operations Research, INFORMS, vol. 20(6), pages 1152-1161, December.
    15. William Cook & Thomas Rutherford & Herbert E. Scarf & David Shallcross, 1993. "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 5(2), pages 206-212, May.
    16. WOLSEY, Laurence A., 1975. "Faces for a linear inequality in 0-1 variables," LIDAM Reprints CORE 218, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. NEMHAUSER, George L. & WOLSEY, Laurence A., 1990. "A recursive procedure to generate all cuts for 0-1 mixed integer programs," LIDAM Reprints CORE 894, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    18. G. B. Dantzig & D. R. Fulkerson & S. M. Johnson, 1959. "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 7(1), pages 58-66, February.
    19. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    20. Aardal, K.I. & Labbé, M. & Leung, J. & Queyranne, M., 1994. "On the two-level uncapacitated facility location problem," Discussion Paper 1994-86, Tilburg University, Center for Economic Research.
    21. Harlan Crowder & Manfred W. Padberg, 1980. "Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality," Management Science, INFORMS, vol. 26(5), pages 495-509, May.
    22. Denis Naddef, 1992. "The Binested Inequalities for the Symmetric Traveling Salesman Polytope," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 882-900, November.
    23. VAN ROY, Tony J. & WOLSEY, Laurence A., 1987. "Solving mixed integer programming problems using automatic reformulation," LIDAM Reprints CORE 782, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    24. Araque, J., 1990. "Lots of combs of different sizes for vehicle routing," LIDAM Discussion Papers CORE 1990074, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    25. Tony J. Van Roy & Laurence A. Wolsey, 1987. "Solving Mixed Integer Programming Problems Using Automatic Reformulation," Operations Research, INFORMS, vol. 35(1), pages 45-57, February.
    26. Schrijver, A, 1980. "On Cutting Planes," University of Amsterdam, Actuarial Science and Econometrics Archive 293054, University of Amsterdam, Faculty of Economics and Business.
    27. Harlan Crowder & Ellis L. Johnson & Manfred Padberg, 1983. "Solving Large-Scale Zero-One Linear Programming Problems," Operations Research, INFORMS, vol. 31(5), pages 803-834, October.
    28. Leung, Janny, 1994. "Polyhedral structure and properties of a model for layout design," European Journal of Operational Research, Elsevier, vol. 77(2), pages 195-207, September.
    29. Francisco Barahona & Martin Grötschel & Ali Ridha Mahjoub, 1985. "Facets of the Bipartite Subgraph Polytope," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 340-358, May.
    30. Aardal, K.I., 1994. "Capacitated facility location : Separation algorithms and computational experience," Discussion Paper 1994-80, Tilburg University, Center for Economic Research.
    31. Aardal, K.I. & Labbé, M. & Leung, J. & Queyranne, M., 1994. "On the two-level uncapacitated facility location problem," Other publications TiSEM 946189b7-21c8-4a39-b5fe-a, Tilburg University, School of Economics and Management.
    32. D. Naddef & G. Rinaldi, 1992. "The Crown Inequalities for the Symmetric Traveling Salesman Polytope," Mathematics of Operations Research, INFORMS, vol. 17(2), pages 308-326, May.
    33. VANDERBECK, François & WOLSEY, Laurence, 1994. "An Exact Algorithm for IP Column Generation," LIDAM Discussion Papers CORE 1994019, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    34. Martin Grötschel & Michael Jünger & Gerhard Reinelt, 1984. "A Cutting Plane Algorithm for the Linear Ordering Problem," Operations Research, INFORMS, vol. 32(6), pages 1195-1220, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A Lim & Z Xu & F Wang, 2008. "The bidding selection and assignment problem with minimum quantity commitment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 693-702, May.
    2. Aardal, K. & van Hoesel, C.P.M. & Lenstra, J.K. & Stougie, L., 1997. "A decade of combinatorial optimization," Research Memorandum 023, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Aardal Karen, 1997. "A decade of combinatorial optimization," Research Memorandum 044, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    2. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.
    3. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    4. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    5. Anantaram Balakrishnan & Joseph Geunes, 2003. "Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing," Operations Research, INFORMS, vol. 51(1), pages 94-112, February.
    6. Denis Naddef & Yves Pochet, 2001. "The Symmetric Traveling Salesman Polytope Revisited," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 700-722, November.
    7. Pourbabai, B. & Ashayeri, J. & Van Wassenhove, L.N., 1992. "Strategic marketing, production, and distribution planning of an integrated manufacturing system," Other publications TiSEM 16c2bacb-2c2b-427e-b429-c, Tilburg University, School of Economics and Management.
    8. Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
    9. Agostinho Agra & Cristina Requejo & Eulália Santos, 2016. "Implicit cover inequalities," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1111-1129, April.
    10. Richard Laundy & Michael Perregaard & Gabriel Tavares & Horia Tipi & Alkis Vazacopoulos, 2009. "Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 304-313, May.
    11. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    12. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    13. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    14. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    15. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    16. Xiaoyi Gu & Santanu S. Dey & Jean-Philippe P. Richard, 2024. "Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 884-899, May.
    17. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    18. Bian, Zheyong & Bai, Yun & Douglas, W. Scott & Maher, Ali & Liu, Xiang, 2022. "Multi-year planning for optimal navigation channel dredging and dredged material management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    19. Amitabh Basu & Pierre Bonami & Gérard Cornuéjols & François Margot, 2011. "Experiments with Two-Row Cuts from Degenerate Tableaux," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 578-590, November.
    20. Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:unm:umamet:1995014. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Andrea Willems or Leonne Portz (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.