Mixed-integer nonlinear programs featuring ``on/off constraints
From MaRDI portal
Publication:453616
DOI10.1007/s10589-011-9424-0zbMath1250.90058OpenAlexW1967284207MaRDI QIDQ453616
Pierre Bonami, Adam Ouorou, Hassan Hijazi, Cornuéjols, Gérard
Publication date: 27 September 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9424-0
mixed-integer nonlinear programmingdisjunctive constraints``on/off constraintsdelay-constrained routing problems
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Strong formulations for quadratic optimization with M-matrices and indicator variables, Perspective functions: properties, constructions, and examples, Robust delay-constrained routing in telecommunications, Maximum flow under proportional delay constraint, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, A computational study of perspective cuts, Convex quadratic relaxations for mixed-integer nonlinear programs in power systems, Extended formulations in mixed integer conic quadratic programming, Unnamed Item, Constraint qualification failure in action, Convex Relaxations for Gas Expansion Planning, Supermodularity and valid inequalities for quadratic optimization with indicators, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs, Unnamed Item, Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution, Quadratic convex reformulation for quadratic programming with linear on-off constraints, Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks, Unnamed Item, On speed scaling via integer programming, Strong formulations for conic quadratic optimization with indicator variables, Strong mixed-integer programming formulations for trained neural networks, Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching, Small and strong formulations for unions of convex sets from the Cayley embedding, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Between steps: intermediate relaxations between big-M and convex hull formulations, Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- An algorithmic framework for convex mixed integer nonlinear programs
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A new implementation of Yen's ranking loopless paths algorithm
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Disjunctive Programming
- A tree-search algorithm for mixed integer programming problems
