Polyhedral analysis and branch-and-cut for the structural analysis problem

DOI10.1007/978-3-642-32147-4_12MaRDI QIDQ3167618zbMATH OpenOpenAlexFDO

Authors Mathieu Lacroix, Sébastien Martin, A. R. Mahjoub

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_12

zbMATH Keywords

bipartite graphbranch-and-cutconditional differential-algebraic systemfacetmatchingpolytopestructural analysis

Mathematics Subject Classification ID

Implicit ordinary differential equations, differential-algebraic equations (34A09) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Structural analysis for differential-algebraic systems: complexity, formulation and facets
• Structural analysis for differential algebraic systems
• A polyhedral approach to the \textit{alldifferent} system
• Polyhedral analysis for concentrator location problems
• The k-node connected subgraph problem: polyhedral analysis and branch-and-cut

Cited in

(2)

• A comprehensive analysis of polyhedral lift-and-project methods
• Structural analysis for differential-algebraic systems: complexity, formulation and facets

This page was built for publication: Polyhedral analysis and branch-and-cut for the structural analysis problem

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