Valid inequalities for separable concave constraints with indicator variables
From MaRDI portal
Publication:1801013
DOI10.1007/s10107-017-1197-5zbMath1412.90094OpenAlexW2761119336MaRDI QIDQ1801013
Jeff Linderoth, Cong Han Lim, James R. Luedtke
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1197-5
Related Items
Uses Software
Cites Work
- Unnamed Item
- Mathematical programming techniques in water network optimization
- Valid inequalities for mixed 0-1 programs
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- A study of the lot-sizing polytope
- BARON: A general purpose global optimization software package
- Sequence independent lifting in mixed integer programming
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum concave cost flow over a grid network
- Mixed integer models for the stationary case of gas network optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An Algorithmic Framework for MINLP with Separable Non-Convexity
- Extending a CIP Framework to Solve MIQCPs
- Valid Inequalities for Separable Concave Constraints with Indicator Variables
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Disjunctive Programming
- A polynomial time solvable concave network flow problem
- Mixed-integer nonlinear optimization
- Minimum Concave Cost Flows in Certain Networks
