Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
From MaRDI portal
Publication:1580967
DOI10.1016/S0377-2217(99)00453-1zbMATH Open0969.90075OpenAlexW2079809585MaRDI QIDQ1580967FDOQ1580967
Authors: Paolo Toth 
Publication date: 23 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00453-1
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Boolean programming (90C09)
Cites Work
- Algorithm 750: CDT
- TSPLIB—A Traveling Salesman Problem Library
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Title not available (Why is that?)
- The ellipsoid method and its consequences in combinatorial optimization
- Branch-and-price: Column generation for solving huge integer programs
- Finding optimum branchings
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Title not available (Why is that?)
- Optimum branchings
- The traveling salesman problem: An overview of exact and approximate algorithms
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- An Algorithm for Large Zero-One Knapsack Problems
- Computing Partitions with Applications to the Knapsack Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Properties of some ILP formulations of a class of partitioning problems
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Discrete-variable extremum problems
- Solving binary cutting stock problems by column generation and branch- and-bound
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- A New Algorithm for the 0-1 Knapsack Problem
- Facets of the Asymmetric Traveling Salesman Polytope
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- The Loading Problem
- Lower bounds and reduction procedures for the bin packing problem
- An efficient algorithm for the minimum capacity cut problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Algorithms and codes for dense assignment problems: The state of the art
- Title not available (Why is that?)
- Dynamic programming algorithms for the zero-one knapsack problem
- Bithreshold Graphs
- Title not available (Why is that?)
- A restricted Lagrangean approach to the traveling salesman problem
- Primal-dual algorithms for the assignment problem
- An algorithm for the solution of the 0-1 knapsack problem
- An additive bounding procedure for the asymmetric travelling salesman problem
- Exact solution of large-scale, asymmetric traveling salesman problems
- A note on finding optimum branchings
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- An Efficient Algorithm for the 0-1 Knapsack Problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- An algorithm for a class of loading problems
- Resolution of the 0–1 knapsack problem: Comparison of methods
- Thek best spanning arborescences of a network
Cited In (6)
- An algorithm for computationally expensive engineering optimization problems
- Title not available (Why is that?)
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- An efficient algorithm of dead-end controls for solving combinatorial optimization problems
- Enriching Solutions to Combinatorial Problems via Solution Engineering
Uses Software
This page was built for publication: Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580967)
