On handling indicator constraints in mixed integer programming
From MaRDI portal
Publication:2374361
DOI10.1007/s10589-016-9847-8zbMath1357.90094OpenAlexW2345492474MaRDI QIDQ2374361
Matteo Fischetti, Domenico Salvagnin, Pierre Bonami, Amaya Nogales-Gómez, Pietro Belotti, Andrea Lodi, Michele Monaci
Publication date: 15 December 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9847-8
Related Items (27)
An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems ⋮ Deep neural networks and mixed integer linear optimization ⋮ Pyomo.GDP: an ecosystem for logic based modeling and optimization development ⋮ An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand ⋮ Tightening big Ms in integer programming formulations for support vector machines with ramp loss ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ The continuous quadrant penalty formulation of logical constraints ⋮ Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling ⋮ Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations ⋮ Computational aspects of relaxation complexity: possibilities and limitations ⋮ Adversarial classification via distributional robustness with Wasserstein ambiguity ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming ⋮ Three enhancements for optimization-based bound tightening ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints ⋮ Computing non-stationary \((s, S)\) policies using mixed integer linear programming ⋮ Strong mixed-integer programming formulations for trained neural networks ⋮ An exact algorithm for robust influence maximization ⋮ Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching ⋮ Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy ⋮ Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms ⋮ An enhanced logical benders approach for linear programs with complementarity constraints ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ On mathematical programming with indicator constraints
Uses Software
Cites Work
- Unnamed Item
- Supervised classification and mathematical optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- Constraint propagation with interval labels
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Presolving in linear programming
- Convex programming for disjunctive convex optimization
- On mathematical programming with indicator constraints
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Support Vector Machines with the Ramp Loss and the Hard Margin Loss
- Branching and bounds tighteningtechniques for non-convex MINLP
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- On ψ-Learning
- Exploiting Erraticism in Search
- Deterministic global optimization using interval constraint propagation techniques
This page was built for publication: On handling indicator constraints in mixed integer programming
