scientific article; zbMATH DE number 780782
From MaRDI portal
Publication:4840772
zbMATH Open0835.90076MaRDI QIDQ4840772FDOQ4840772
Authors: Michael Jünger, Stefan Thienel, Gerhard Reinelt 
Publication date: 28 April 1996
Title of this publication is not available (Why is that?)
Recommendations
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cited In (33)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Colorings at minimum cost
- An exact algorithm for the identical parallel machine scheduling problem.
- A constraint programming approach to cutset problems
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A polyhedral approach to the feedback vertex set problem
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
- A polyhedral approach to sequence alignment problems
- Introduction to ABACUS -- a branch-and-cut system
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Separating capacity constraints in the CVRP using tabu search
- Branch and cut methods for network optimization
- Cutting planes in integer and mixed integer programming
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Computing in combinatorial optimization
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- Combinatorial optimization and small polytopes
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- 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
- Computational Integer Programming and Cutting Planes
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Classical cuts for mixed-integer programming and branch-and-cut
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Problems of discrete optimization: challenges and main approaches to solve them
Uses Software
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)
