MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing, primal heuristics and constraint generation. Moreover, the user can enrich the basic algorithm by providing a variety of specialized application routines that can customize MINTO to achieve maximum efficiency for a problem class. To be as effective and efficient as possible when used as a general purpose mixed-integer optimizer, MINTO attempts to: improve the formulation by preprocessing and probing; construct feasible solutions generate strong valid inequalities perform variable fixing based on reduced prices control the size of the linear programs by managing active constraints. To be as flexible and powerful as possible when used to build a special purpose mixed-integer optimizer, MINTO provides various mechanisms for incorporating problem specific knowledge.

References in zbMATH (referenced in 126 articles )

Showing results 1 to 20 of 126.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Eckstein, Jonathan; Hart, William E.; Phillips, Cynthia A.: PEBBL: an object-oriented framework for scalable parallel branch and bound (2015)
  2. Kılınç, Mustafa; Linderoth, Jeff; Luedtke, James; Miller, Andrew: Strong-branching inequalities for convex mixed integer nonlinear programs (2014)
  3. Beheshti, Zahra; Shamsuddin, Siti Mariyam; Yuhaniz, Siti Sophiayati: Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (2013)
  4. D’ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: an updated practical overview (2013)
  5. Pinheiro, Placido Rogerio; Oliveira, Paulo Roberto: A hybrid approach of bundle and benders applied large mixed linear integer problem (2013)
  6. Bixby, Robert E.: A brief history of linear and mixed-integer programming computation (2012)
  7. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  8. Hu, Jing; Mitchell, John E.; Pang, Jong-Shi: An LPCC approach to nonconvex quadratic programs (2012)
  9. Altın, Ayşegül; Yaman, Hande; Pınar, Mustafa Ç.: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations (2011)
  10. D’Ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: a practical overview (2011)
  11. Lin, Geng; Zhu, Wenxing; Ali, M.M.: An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (2011)
  12. Ostrowski, James; Linderoth, Jeff; Rossi, Fabrizio; Smriglio, Stefano: Orbital branching (2011)
  13. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
  14. Vanderbeck, François: Branching in branch-and-price: A generic scheme (2011)
  15. Abhishek, Kumar; Leyffer, Sven; Linderoth, Jeff: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs (2010)
  16. Abhishek, Kumar; Leyffer, Sven; Linderoth, Jeffrey T.: Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems (2010)
  17. Altın, Ayşegül; Belotti, Pietro; Pınar, Mustafa Ç.: OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (2010)
  18. Clausen, Jens; Larsen, Allan; Larsen, Jesper; Rezanova, Natalia J.: Disruption management in the airline industry-concepts, models and methods (2010)
  19. Wojtaszek, Daniel T.; Chinneck, John W.: Faster MIP solutions via new node selection rules (2010)
  20. Karzan, Fatma Kılınç; Nemhauser, George L.; Savelsbergh, Martin W.P.: Information-based branching schemes for binary linear mixed integer problems (2009)

1 2 3 ... 5 6 7 next