On interval-subgradient and no-good cuts
From MaRDI portal
Publication:613320
DOI10.1016/j.orl.2010.05.010zbMath1202.90238OpenAlexW2064092627WikidataQ118165472 ScholiaQ118165472MaRDI QIDQ613320
Leo Liberti, Claudia D'Ambrosio, Andrea Lodi, Antonio Frangioni
Publication date: 20 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.05.010
Related Items
Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Bilevel Knapsack with Interdiction Constraints, Quadratic programs with hollows, Polynomial size IP formulations of knapsack may require exponentially large coefficients, Application-oriented mixed integer non-linear programming, A storm of feasibility pumps for nonconvex MINLP, Fairness over time in dynamic resource allocation with an application in healthcare, Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems, An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints, Regularized optimization methods for convex MINLP problems, Rounding-based heuristics for nonconvex MINLPS, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval analysis on directed acyclic graphs for global optimization
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Conic mixed-integer rounding cuts
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- A new reformulation-linearization technique for bilinear programming problems
- Rounding-based heuristics for nonconvex MINLPS
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization problems and domain reduction strategies
- Convex programming for disjunctive convex optimization
- Information-based branching schemes for binary linear mixed integer problems
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Cuts for mixed 0-1 conic programming
- Feasibility-Based Bounds Tightening via Fixed Points
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Disjunctive Programming
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Canonical Cuts on the Unit Hypercube
- Semidefinite relaxations of fractional programs via novel convexification techniques
