Irreducible infeasible sets in convex mixed-integer programs
From MaRDI portal
Publication:495724
DOI10.1007/s10957-015-0720-1zbMath1327.90119OpenAlexW2156544990MaRDI QIDQ495724
Publication date: 15 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0720-1
Uses Software
Cites Work
- Feasibility in reverse convex mixed-integer programming
- Unboundedness in reverse convex and concave integer programming
- On boundedness of (quasi-)convex integer optimization problems
- A feasibility pump for mixed integer nonlinear programs
- On infeasibility of systems of convex analytic inequalities
- Infeasibility analysis for systems of quadratic convex inequalities
- Some results concerning post-infeasibility analysis
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Consistency, redundancy, and implied equalities in linear systems
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Analyzing infeasible nonlinear programs
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Minimal infeasible constraint sets in convex integer programs
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Nonlinear integer programming
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Technical Note—Recognizing Unbounded Integer Programs
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Irreducible infeasible sets in convex mixed-integer programs
