scientific article; zbMATH DE number 780782
From MaRDI portal
Publication:4840772
Recommendations
Cited in
(33)- Introduction to ABACUS -- a branch-and-cut system
- An exact algorithm for the identical parallel machine scheduling problem.
- A polyhedral approach to sequence alignment problems
- Separating capacity constraints in the CVRP using tabu search
- On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Combinatorial optimization and small polytopes
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Computing in combinatorial optimization
- Problems of discrete optimization: challenges and main approaches to solve them
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- A constraint programming approach to cutset problems
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
- Generating cutting planes for mixed integer programming problems in a parallel computing environment
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- scientific article; zbMATH DE number 1953192 (Why is no real title available?)
- scientific article; zbMATH DE number 1538005 (Why is no real title available?)
- A polyhedral approach to the feedback vertex set problem
- scientific article; zbMATH DE number 219017 (Why is no real title available?)
- scientific article; zbMATH DE number 2084781 (Why is no real title available?)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
- Computational Integer Programming and Cutting Planes
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Classical cuts for mixed-integer programming and branch-and-cut
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Branch and cut methods for network optimization
- Cutting planes in integer and mixed integer programming
- Colorings at minimum cost
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 Q4840772)
