Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2017.0783
Download full text from publisher
References listed on IDEAS
- Jesús A. De Loera & Raymond Hemmecke & Matthias Köppe, 2009. "Pareto Optima of Multicriteria Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 39-48, February.
- Gülseren Kiziltan & Erkut Yucaou{g}lu, 1983. "An Algorithm for Multiobjective Zero-One Linear Programming," Management Science, INFORMS, vol. 29(12), pages 1444-1453, December.
- Minghe Sun, 2006. "A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization," Annals of Operations Research, Springer, vol. 147(1), pages 87-107, October.
- Ted Ralphs & Matthew Saltzman & Margaret Wiecek, 2006. "An improved algorithm for solving biobjective integer programs," Annals of Operations Research, Springer, vol. 147(1), pages 43-70, October.
- Thomas Stidsen & Kim Allan Andersen & Bernd Dammann, 2014. "A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs," Management Science, INFORMS, vol. 60(4), pages 1009-1032, April.
- Nicolas Jozefowiez & Gilbert Laporte & Frédéric Semet, 2012. "A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 554-564, November.
- H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
- Minghe Sun & Ralph E. Steuer, 1996. "Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 367-375, November.
- Francis Sourd & Olivier Spanjaard, 2008. "A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 472-484, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Sophie N. Parragh & Fabien Tricoire, 2019. "Branch-and-Bound for Bi-objective Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 805-822, October.
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.- Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
- Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
- David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
- Forget, Nicolas & Gadegaard, Sune Lauth & Nielsen, Lars Relund, 2022. "Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 302(3), pages 909-924.
- Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
- Sune Lauth Gadegaard & Lars Relund Nielsen & Matthias Ehrgott, 2019. "Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 790-804, October.
- Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
- De Santis, Marianna & Grani, Giorgio & Palagi, Laura, 2020.
"Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming,"
European Journal of Operational Research, Elsevier, vol. 283(1), pages 57-69.
- Marianna De Santis & Giorgio Grani & Laura Palagi, 2019. "Branching with Hyperplanes in the Criterion Space:the Frontier Partitioner Algorithm for Biobjective Integer Programming," DIAG Technical Reports 2019-03, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Sophie N. Parragh & Fabien Tricoire, 2019. "Branch-and-Bound for Bi-objective Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 805-822, October.
- Sun, Minghe, 2011. "A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization," European Journal of Operational Research, Elsevier, vol. 209(3), pages 228-240, March.
- Thomas Stidsen & Kim Allan Andersen & Bernd Dammann, 2014. "A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs," Management Science, INFORMS, vol. 60(4), pages 1009-1032, April.
- Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
- Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
- Dächert, Kerstin & Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2017. "Efficient computation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 841-855.
- I. Kaliszewski & J. Miroforidis, 2022. "Probing the Pareto front of a large-scale multiobjective problem with a MIP solver," Operational Research, Springer, vol. 22(5), pages 5617-5673, November.
- Markus Leitner & Ivana Ljubić & Markus Sinnl, 2015. "A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 118-134, February.
- Tolga Bektaş, 2018. "Disjunctive Programming for Multiobjective Discrete Optimisation," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 625-633, November.
- Soylu, Banu, 2018. "The search-and-remove algorithm for biobjective mixed-integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 268(1), pages 281-299.
- M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
- K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
More about this item
Keywords
biobjective mixed integer optimization; Pareto set; data structure;All these keywords.
Statistics
Access and download statisticsCorrections
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:inm:orijoc:v:30:y:2018:i:2:p:324-338. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.