Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming
From MaRDI portal
Publication:4922925
DOI10.1007/978-3-642-38171-3_26zbMath1382.90063OpenAlexW2118587633MaRDI QIDQ4922925
Stefan Weltge, Ambros M. Gleixner
Publication date: 4 June 2013
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_26
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Tight convex relaxations for the expansion planning problem, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Domain reduction techniques for global NLP and MINLP optimization, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
Uses Software
