Pages that link to "Item:Q2482881"

The following pages link to Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881):

Displaying 17 items.

• Pooling problems with polynomial-time algorithms (Q306403) (← links)
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
• Compactness criteria for real algebraic sets and Newton polyhedra (Q1756670) (← links)
• Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
• Computing the face lattice of a polytope from its vertex-facet incidences (Q1862131) (← links)
• A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
• The Lasso problem and uniqueness (Q1951165) (← links)
• Robust fitting in computer vision: easy or hard? (Q2193856) (← links)
• The maximal descriptor index set for a face of a convex polyhedral set and some applications (Q2345491) (← links)
• A note on the selection of Benders' cuts (Q2638375) (← links)
• The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
• A common formula to compute the efficient sets of a class of multiple objective linear programming problems (Q3454856) (← links)
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm (Q5058020) (← links)
• Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
• Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)