scientific article

zbMATH Open1241.90184MaRDI QIDQ3081841

A. R. Mahjoub

Publication date: 9 March 2011

Title of this publication is not available (Why is that?)

zbMATH Keywords

combinatorial optimization problemscombinatorial structuresmin-max relationships

Mathematics Subject Classification ID

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

Cited In (13)

• Geometric Pólya-Aeppli process
• Sinc Methods on Polyhedra
• Title not available (Why is that?)
• Solution of polyhedra
• polymake: a framework for analyzing convex polytopes
• Finding feasible vectors of Edmonds-Giles polyhedra
• DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES
• Fast polyhedra abstract domain
• Optimization algorithms for the disjunctively constrained knapsack problem
• 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

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 Q3081841)