The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
From MaRDI portal
Publication:4789079
DOI<1325::AID-SPE342>3.0.CO;2-T 10.1002/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-TzbMath1147.90416OpenAlexW2038195012MaRDI QIDQ4789079
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<1325::aid-spe342>3.0.co;2-t
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Combinatorial optimization (90C27)
Related Items
Single-commodity robust network design with finite and hose demand sets, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, Applying mod-\(k\)-cuts for solving linear ordering problems, Polyhedral analysis for concentrator location problems, Solving the hub location problem with modular link capacities, The Influence of Preprocessing on Steiner Tree Approximations, OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms, Lifting and separation procedures for the cut polytope, A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem, Minimizing breaks by maximizing cuts., Crossing Minimization in Storyline Visualization, PEBBL: an object-oriented framework for scalable parallel branch and bound, Dantzig-Wolfe decomposition and branch-and-price solving in G12, From High-Level Model to Branch-and-Price Solution in G12, A cutting plane algorithm for graph coloring, Formulations and exact algorithms for the vehicle routing problem with time windows, Integrating operations research in constraint programming, A branch-and-cut approach to the crossing number problem, Integrating operations research in constraint programming, Algebraic modeling for IP and MIP (GAMS), A branch-and-cut algorithm for graph coloring, A branch and cut algorithm for hub location problems with single assignment, Lagrangian duality applied to the vehicle routing problem with time windows, A polyhedral study of the maximum edge subgraph problem, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Computing Maximum C-Planar Subgraphs, Linear optimization over permutation groups, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Row and column generation technique for a multistage cutting stock problem
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Introduction to ABACUS -- a branch-and-cut system
- MOPS -- Mathematical optimization system
- Solving binary cutting stock problems by column generation and branch- and-bound
- MINTO, a Mixed INTeger Optimizer
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Outline of an algorithm for integer solutions to linear programs
- 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
- Odd Minimum Cut-Sets and b-Matchings
- TSPLIB—A Traveling Salesman Problem Library
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- On Linear Characterizations of Combinatorial Optimization Problems
- Paths, Trees, and Flowers
- Edmonds polytopes and weakly hamiltonian graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
