scientific article; zbMATH DE number 780782
From MaRDI portal
Publication:4840772
zbMath0835.90076MaRDI QIDQ4840772
Stefan Thienel, Michael Jünger, Gerhard Reinelt
Publication date: 28 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)
Related Items (22)
Problems of discrete optimization: challenges and main approaches to solve them ⋮ On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications ⋮ An exact algorithm for the identical parallel machine scheduling problem. ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ A polyhedral approach to the feedback vertex set problem ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Colorings at minimum cost ⋮ Cutting planes in integer and mixed integer programming ⋮ Branch and cut methods for network optimization ⋮ A branch-and-cut algorithm for scheduling of projects with variable-intensity activities ⋮ A constraint generation algorithm for large scale linear programs using multiple-points separation ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ Combinatorial optimization and small polytopes ⋮ Introduction to ABACUS -- a branch-and-cut system ⋮ Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut ⋮ Computing in combinatorial optimization ⋮ Acceleration of cutting-plane and column generation algorithms: Applications to network design ⋮ A polyhedral approach to sequence alignment problems ⋮ A cutting plane algorithm for the unrelated parallel machine scheduling problem ⋮ Separating capacity constraints in the CVRP using tabu search
Uses Software
This page was built for publication:
