A feasible rounding approach for mixed-integer optimization problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-018-0042-y
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Frederick S. Hillier, 1969. "Efficient Heuristic Procedures for Integer Linear Programming with an Interior," Operations Research, INFORMS, vol. 17(4), pages 600-637, August.
- Pierre Bonami & João Gonçalves, 2012. "Heuristics for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 51(2), pages 729-747, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Charly Robinson La Rocca & Jean-François Cordeau & Emma Frejinger, 2024. "One-Shot Learning for MIPs with SOS1 Constraints," SN Operations Research Forum, Springer, vol. 5(3), pages 1-28, September.
- Christoph Neumann & Oliver Stein & Nathan Sudermann-Merx, 2020. "Granularity in Nonlinear Mixed-Integer Optimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 433-465, February.
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.- Chunyi Wang & Fengzhang Luo & Zheng Jiao & Xiaolei Zhang & Zhipeng Lu & Yanshuo Wang & Ren Zhao & Yang Yang, 2022. "An Enhanced Second-Order Cone Programming-Based Evaluation Method on Maximum Hosting Capacity of Solar Energy in Distribution Systems with Integrated Energy," Energies, MDPI, vol. 15(23), pages 1-19, November.
- Robert M. Saltzman & Frederick S. Hillier, 1991. "An exact ceiling point algorithm for general integer linear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 53-69, February.
- Sonia Cafieri & Claudia D’Ambrosio, 2018. "Feasibility pump for aircraft deconfliction with speed regulation," Journal of Global Optimization, Springer, vol. 71(3), pages 501-515, July.
- Christoph Neumann & Oliver Stein & Nathan Sudermann-Merx, 2020. "Granularity in Nonlinear Mixed-Integer Optimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 433-465, February.
- Andrew Allman & Qi Zhang, 2021. "Branch-and-price for a class of nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 81(4), pages 861-880, December.
- Meenarli Sharma & Prashant Palkar & Ashutosh Mahajan, 2022. "Linearization and parallelization schemes for convex mixed-integer nonlinear optimization," Computational Optimization and Applications, Springer, vol. 81(2), pages 423-478, March.
- Justin A. Sirignano & Gerry Tsoukalas & Kay Giesecke, 2016. "Large-Scale Loan Portfolio Selection," Operations Research, INFORMS, vol. 64(6), pages 1239-1255, December.
- Joseph, A. & Gass, S. I., 2002. "A framework for constructing general integer problems with well-determined duality gaps," European Journal of Operational Research, Elsevier, vol. 136(1), pages 81-94, January.
- Francisco Trespalacios & Ignacio E. Grossmann, 2016. "Cutting Plane Algorithm for Convex Generalized Disjunctive Programs," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 209-222, May.
- Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
- Timo Berthold & Andrea Lodi & Domenico Salvagnin, 2019. "Ten years of feasibility pump, and counting," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(1), pages 1-14, March.
- Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
- M. Li & L. Vicente, 2013. "Inexact solution of NLP subproblems in MINLP," Journal of Global Optimization, Springer, vol. 55(4), pages 877-899, April.
- Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
- Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
- Antonio Frangioni & Fabio Furini & Claudio Gentile, 2016. "Approximated perspective relaxations: a project and lift approach," Computational Optimization and Applications, Springer, vol. 63(3), pages 705-735, April.
- Joseph, Anito & Gass, Saul I. & Bryson, Noel, 1998. "An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem," European Journal of Operational Research, Elsevier, vol. 104(3), pages 601-614, February.
- Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
- Kuo-Ling Huang & Sanjay Mehrotra, 2015. "An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs," Computational Optimization and Applications, Springer, vol. 60(3), pages 559-585, April.
- Timo Berthold, 2018. "A computational study of primal heuristics inside an MI(NL)P solver," Journal of Global Optimization, Springer, vol. 70(1), pages 189-206, January.
More about this item
Keywords
Rounding; Granularity; Inner parallel set; Consistency;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:spr:coopap:v:72:y:2019:i:2:d:10.1007_s10589-018-0042-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.