Polyhedral approaches

MaRDI QIDQ3081841zbMATH OpenFDO

Authors A. R. Mahjoub

Publication date 9 March 2011

zbMATH Keywords

combinatorial optimization problemscombinatorial structuresmin-max relationships

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Polyhedral techniques in combinatorial optimization II: applications and computations
• Recent trends in combinatorial optimization
• Polyhedral techniques in combinatorial optimization I: Theory
• scientific article; zbMATH DE number 3887435
• Polyhedral proof methods in combinatorial optimization

Cited in

(18)

• Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
• Geometric Pólya-Aeppli process
• Sinc Methods on Polyhedra
• scientific article; zbMATH DE number 742976 (Why is no real title available?)
• Solution approaches to the three-index assignment problem
• Computational approaches to MAX-cut
• Solution of polyhedra
• Finding feasible vectors of Edmonds-Giles polyhedra
• polymake: a framework for analyzing convex polytopes
• Polyhedral proof methods in combinatorial optimization
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
• Optimization algorithms for the disjunctively constrained knapsack problem
• Fast polyhedra abstract domain
• Counterexample-Guided Refinement of Template Polyhedra
• The polyhedral Lagrange principle
• A comprehensive analysis of polyhedral lift-and-project methods
• An efficient abstract domain for not necessarily closed polyhedra
• scientific article; zbMATH DE number 833409 (Why is no real title available?)

This page was built for publication: Polyhedral approaches

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