scientific article
From MaRDI portal
Publication:3023951
zbMath1114.52301MaRDI QIDQ3023951
Publication date: 7 July 2005
Full work available at URL: http://d-nb.info/966162846
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Oriented matroids in discrete geometry (52C40)
Related Items
Some approaches to the solution of optimization problems in supervised learning, The maximum feasible subset problem (maxFS) and applications, Constructing patterns of (many) ESSs under support size control, HySAT: An efficient proof engine for bounded model checking of hybrid systems, Faster maximum feasible subsystem solutions for dense constraint matrices, Irreducible infeasible subsystems of semidefinite systems, A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set, A two-phase relaxation-based heuristic for the maximum feasible subsystem problem, Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions, Conflict analysis in mixed integer programming, Automatic repair of convex optimization problems, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, Generating all vertices of a polyhedron is hard, Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices
