scientific article; zbMATH DE number 2186837

MaRDI QIDQ3023951zbMATH OpenFDO

Authors Marc E. Pfetsch

Publication date 7 July 2005

Full work available at URL http://d-nb.info/966162846

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55) Oriented matroids in discrete geometry (52C40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
• A polyhedral study of the maximum edge subgraph problem
• A polyhedral study of the maximum edge subgraph problem
• Combinatorial properties and further facets of maximum edge subgraph polytopes
• A CHARACTERIZATION OF FACES OF THE BASE POLYHEDRON ASSOCIATED WITH A SUBMODULAR SYSTEM
• The polyhedron of a problem on an m-vertex subgraph of a complete graph
• Ideal polytopes and face structures of some combinatorial optimization problems
• scientific article; zbMATH DE number 4108497
• scientific article; zbMATH DE number 3869364
• A Min--Max Theorem for Bisubmodular Polyhedra

Cited in

(21)

• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• Automatic repair of convex optimization problems
• Irreducible infeasible subsystems of semidefinite systems
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Conflict analysis in mixed integer programming
• Faster maximum feasible subsystem solutions for dense constraint matrices
• Some approaches to the solution of optimization problems in supervised learning
• Ambiguous incidences of unbounded polyhedra
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• scientific article; zbMATH DE number 139917 (Why is no real title available?)
• scientific article; zbMATH DE number 1342119 (Why is no real title available?)
• IIS-Hypergraphs
• A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
• Enumerating vertices of 0/1-polyhedra associated with 0/1-totally unimodular matrices
• Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
• Combinatorial geometry and graphs in an analysis of infeasible systems and pattern recognition
• The maximum feasible subset problem (maxFS) and applications
• Generating all vertices of a polyhedron is hard
• Constructing patterns of (many) ESSs under support size control
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3023951)