Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems

90C35: Programming involving graphs or networks

90C27: Combinatorial optimization

90C09: Boolean programming

Uses Software

CDT
TSPLIB
Knapsack
Bison

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Lower bounds and reduction procedures for the bin packing problem
An efficient algorithm for the minimum capacity cut problem
Primal-dual algorithms for the assignment problem
Dynamic programming algorithms for the zero-one knapsack problem
An algorithm for the solution of the 0-1 knapsack problem
The ellipsoid method and its consequences in combinatorial optimization
An additive bounding procedure for the asymmetric travelling salesman problem
The traveling salesman problem: An overview of exact and approximate algorithms
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
Properties of some ILP formulations of a class of partitioning problems
Exact solution of bin-packing problems using column generation and branch-and-bound
A branch-and-bound algorithm for the two-dimensional vector packing problem
Solving binary cutting stock problems by column generation and branch- and-bound
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
An expanding-core algorithm for the exact \(0-1\) knapsack problem
New trends in exact algorithms for the \(0-1\) knapsack problem
Algorithms and codes for dense assignment problems: The state of the art
Computational study of a column generation algorithm for bin packing and cutting stock problems
Branch-and-Price: Column Generation for Solving Huge Integer Programs
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
A Linear Programming Approach to the Cutting-Stock Problem
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Bithreshold Graphs
A New Algorithm for the 0-1 Knapsack Problem
A note on finding optimum branchings
Thek best spanning arborescences of a network
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
An Algorithm for Large Zero-One Knapsack Problems
A restricted Lagrangean approach to the traveling salesman problem
Facets of the Asymmetric Traveling Salesman Polytope
TSPLIB—A Traveling Salesman Problem Library
Resolution of the 0–1 knapsack problem: Comparison of methods
Computing Partitions with Applications to the Knapsack Problem
An Efficient Algorithm for the 0-1 Knapsack Problem
Finding optimum branchings
An algorithm for a class of loading problems
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
Exact solution of large-scale, asymmetric traveling salesman problems
Algorithm 750: CDT
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
A Minimal Algorithm for the 0-1 Knapsack Problem
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
A Linear Programming Approach to the Cutting Stock Problem—Part II
Discrete-Variable Extremum Problems
Optimum branchings
The Loading Problem
Pathology of Traveling-Salesman Subtour-Elimination Algorithms