Mixed-integer nonlinear programs featuring ``on/off constraints
From MaRDI portal
Publication:453616
DOI10.1007/S10589-011-9424-0zbMATH Open1250.90058OpenAlexW1967284207MaRDI QIDQ453616FDOQ453616
Authors: Hassan Hijazi, Pierre Bonami, Adam Ouorou, Gérard Cornuéjols 
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
Recommendations
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- On branching rules for convex mixed-integer nonlinear optimization
mixed-integer nonlinear programmingdisjunctive constraints``on/off constraintsdelay-constrained routing problems
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- An algorithmic framework for convex mixed integer nonlinear programs
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Title not available (Why is that?)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A new implementation of Yen's ranking loopless paths algorithm
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive Programming
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- A tree-search algorithm for mixed integer programming problems
- Mathematical models of the delay constrained routing problem
- Title not available (Why is that?)
Cited In (35)
- Mathematical programming for simultaneous feature selection and outlier detection under l1 norm
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- Small and strong formulations for unions of convex sets from the Cayley embedding
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- Title not available (Why is that?)
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- A computational study of perspective cuts
- Strong formulations for conic quadratic optimization with indicator variables
- Perspective functions: properties, constructions, and examples
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- On speed scaling via integer programming
- Robust delay-constrained routing in telecommunications
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Supermodularity and valid inequalities for quadratic optimization with indicators
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Title not available (Why is that?)
- Constraint qualification failure in action
- On the convexification of constrained quadratic optimization problems with indicator variables
- Maximum flow under proportional delay constraint
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Ideal formulations for constrained convex optimization problems with indicator variables
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Extended formulations in mixed integer conic quadratic programming
- Convex relaxations for gas expansion planning
Uses Software
This page was built for publication: Mixed-integer nonlinear programs featuring ``on/off constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453616)
