Irreducible infeasible sets in convex mixed-integer programs
From MaRDI portal
(Redirected from Publication:495724)
Recommendations
- Minimal infeasible constraint sets in convex integer programs
- scientific article; zbMATH DE number 1059237
- A mathematical programming problem with a convex irregular feasible set
- Mixed integer programming with a class of nonlinear convex constraints
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Feasibility in reverse convex mixed-integer programming
- Integer set reduction for stochastic mixed-integer programming
- Computational aspects of infeasibility analysis in mixed integer programming
- scientific article; zbMATH DE number 3920195
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
Cites work
- A feasibility pump for mixed integer nonlinear programs
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Analyzing infeasible nonlinear programs
- Consistency, redundancy, and implied equalities in linear systems
- Convex Analysis
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Feasibility in reverse convex mixed-integer programming
- Feasible partition problem in reverse convex and convex mixed-integer programming
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 57208 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 4786 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3399051 (Why is no real title available?)
- scientific article; zbMATH DE number 3062451 (Why is no real title available?)
- Infeasibility analysis for systems of quadratic convex inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Minimal infeasible constraint sets in convex integer programs
- Nonlinear integer programming
- On boundedness of (quasi-)convex integer optimization problems
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- On infeasibility of systems of convex analytic inequalities
- On the existence of optimal solutions to integer and mixed-integer programming problems
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Some results concerning post-infeasibility analysis
- Technical Note—Recognizing Unbounded Integer Programs
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Unboundedness in reverse convex and concave integer programming
Cited in
(6)- On infeasibility of systems of convex analytic inequalities
- Infeasibility analysis for systems of quadratic convex inequalities
- Minimal infeasible constraint sets in convex integer programs
- Certificates of linear mixed integer infeasibility
- Identifying Minimally Infeasible Subsystems of Inequalities
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
This page was built for publication: Irreducible infeasible sets in convex mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495724)