On mathematical programming with indicator constraints
From MaRDI portal
Publication:2349121
DOI10.1007/s10107-015-0891-4zbMath1328.90086OpenAlexW1965897919MaRDI QIDQ2349121
Pierre Bonami, Andrea Tramontani, Andrea Lodi, Sven Wiese
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0891-4
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, On handling indicator constraints in mixed integer programming, Nonlinear chance constrained problems: optimality conditions, regularization and solvers, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Strong formulations for quadratic optimization with M-matrices and indicator variables, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, Getting away with more network pruning: from sparsity to geometry and linear regions, New ways in municipal flood mitigation: a mixed-integer programming approach and its practical application, The continuous quadrant penalty formulation of logical constraints, Unnamed Item, Deep Neural Networks Pruning via the Structured Perspective Regularization, Supermodularity and valid inequalities for quadratic optimization with indicators, An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, Unnamed Item, Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods, Bi-perspective functions for mixed-integer fractional programs with indicator variables, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, Quadratic convex reformulation for quadratic programming with linear on-off constraints, Models and algorithms for optimising two-dimensional LEGO constructions, Optimization problems for machine learning: a survey, A decomposition approach for optimal gas network extension with a finite set of demand scenarios, 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, Interval-based stochastic dominance: theoretical framework and application to portfolio choices, Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor, An enhanced logical benders approach for linear programs with complementarity constraints, Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Between steps: intermediate relaxations between big-M and convex hull formulations, Nonlinear chance-constrained problems with applications to hydro scheduling, On generalized surrogate duality in mixed-integer nonlinear programming
Uses Software
Cites Work
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Strengthening cuts for mixed integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On handling indicator constraints in mixed integer programming
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Unnamed Item
- Unnamed Item
