scientific article; zbMATH DE number 2086916

MaRDI QIDQ4737521zbMATH OpenFDO

Authors Adam N. Letchford, Andrea Lodi

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370093.htm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
• Separating a superclass of comb inequalities in planar graphs
• Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
• Separating maximally violated comb inequalities in planar graphs
• Separating maximally violated comb inequalities in planar graphs

Cited in

(8)

• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
• Separating maximally violated comb inequalities in planar graphs
• Separating a superclass of comb inequalities in planar graphs
• scientific article; zbMATH DE number 5598224 (Why is no real title available?)
• scientific article; zbMATH DE number 4047102 (Why is no real title available?)
• Separating maximally violated comb inequalities in planar graphs
• Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
• Exploiting planarity in separation routines for the symmetric traveling salesman problem

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