The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

DOI10.1002/1097-024X(200009)30:11%3C1325::AID-SPE342%3E3.0.CO;2-TzbMATH Open1147.90416OpenAlexW2038195012MaRDI QIDQ4789079FDOQ4789079

Stefan Thienel, Michael Jünger

Publication date: 23 January 2003

Full work available at URL: https://doi.org/10.1002/1097-024x(200009)30:11%3C1325::aid-spe342%3E3.0.co;2-t

zbMATH Keywords

combinatorial optimizationbranch and cutbranch and priceobject-oriented designsoftware frameworks

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• MOPS -- Mathematical optimization system
• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A note on two problems in connexion with graphs
• A Linear Programming Approach to the Cutting-Stock Problem
• An Automatic Method of Solving Discrete Programming Problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Paths, Trees, and Flowers
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Outline of an algorithm for integer solutions to linear programs
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Odd Minimum Cut-Sets and b-Matchings
• Solving binary cutting stock problems by column generation and branch- and-bound
• MINTO, a Mixed INTeger Optimizer
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Title not available (Why is that?)
• Edmonds polytopes and weakly hamiltonian graphs
• Title not available (Why is that?)
• Introduction to ABACUS -- a branch-and-cut system
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Linear Characterizations of Combinatorial Optimization Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (30)

• A branch-and-cut approach to the crossing number problem
• Lifting and separation procedures for the cut polytope
• OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
• Algebraic modeling for IP and MIP (GAMS)
• Applying mod-\(k\)-cuts for solving linear ordering problems
• Linear optimization over permutation groups
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
• The Influence of Preprocessing on Steiner Tree Approximations
• Computing Maximum C-Planar Subgraphs
• Polyhedral analysis for concentrator location problems
• Single-commodity robust network design with finite and hose demand sets
• Minimizing breaks by maximizing cuts.
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Row and column generation technique for a multistage cutting stock problem
• Crossing Minimization in Storyline Visualization
• Dantzig-Wolfe decomposition and branch-and-price solving in G12
• Title not available (Why is that?)
• A polyhedral study of the maximum edge subgraph problem
• A branch and cut algorithm for hub location problems with single assignment
• A cutting plane algorithm for graph coloring
• A branch-and-cut algorithm for graph coloring
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Integrating operations research in constraint programming
• From High-Level Model to Branch-and-Price Solution in G12
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Lagrangian duality applied to the vehicle routing problem with time windows
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Solving the hub location problem with modular link capacities
• Integrating operations research in constraint programming
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly

Uses Software

• TSPLIB
• ABACUS
• SoPlex
• CPLEX
• LINDO
• MINTO
• PORTA
• MINOS
• MOPS
• OSL

   Recommendations

• Introduction to ABACUS -- a branch-and-cut system 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs 👍 👎
• Parallel branch, cut, and price for large-scale discrete optimization 👍 👎

This page was built for publication: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

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