Introduction to ABACUS -- a branch-and-cut system

DOI10.1016/S0167-6377(98)00013-3zbMath0911.90282MaRDI QIDQ1271386

Michael Jünger, Stefan Thienel

Publication date: 15 November 1998

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

ABACUSbranch-and-cutbranch-and-pricesoftware systems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (14)

The biobjective travelling purchaser problem ⋮ Design of survivable IP-over-optical networks ⋮ Solving the asymmetric traveling purchaser problem ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Branching in branch-and-price: A generic scheme ⋮ A polyhedral approach to the feedback vertex set problem ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ SCIP: solving constraint integer programs ⋮ A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows ⋮ Combinatorial optimization and small polytopes ⋮ Plant location with minimum inventory ⋮ Projection, lifting and extended formulation integer and combinatorial optimization ⋮ Airline crew scheduling: state-of-the-art

Uses Software

• Unnamed Item
• SoPlex
• CPLEX
• MINTO
• OSL

Cites Work

• MINTO, a Mixed INTeger Optimizer
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A polyhedral approach to the feedback vertex set problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Introduction to ABACUS -- a branch-and-cut system