Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
type: Item
instance of: scholarly article
title: Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
zbMATH Open document ID: 0969.90075
DOI: 10.1016/S0377-2217(99)00453-1
author: Paolo Toth
published in: European Journal of Operational Research
publication date: 2000-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1507968
zbMATH Keywords: integer programming
zbMATH Keywords: optimization engineering
zbMATH Keywords: bin packing
zbMATH Keywords: knapsack
zbMATH Keywords: travelling salesman
describes a project that uses: Knapsack
describes a project that uses: CDT
describes a project that uses: TSPLIB
describes a project that uses: Bison
MaRDI profile type: Publication
cites work: The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Q3241581
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: A note on finding optimum branchings
cites work: Thek best spanning arborescences of a network
cites work: Properties of some ILP formulations of a class of partitioning problems
cites work: Q4398361
cites work: Exact solution of large-scale, asymmetric traveling salesman problems
cites work: Algorithm 750: CDT
cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
cites work: Primal-dual algorithms for the assignment problem
cites work: Discrete-Variable Extremum Problems
cites work: Algorithms and codes for dense assignment problems: The state of the art
cites work: Optimum branchings
cites work: The Loading Problem
cites work: Resolution of the 0–1 knapsack problem: Comparison of methods
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: Facets of the Asymmetric Traveling Salesman Polytope
cites work: An additive bounding procedure for the asymmetric travelling salesman problem
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q5187226
cites work: Bithreshold Graphs
cites work: Multiple-type, two-dimensional bin packing problems: Applications and algorithms
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: An algorithm for a class of loading problems
cites work: Q4845366
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Q4130999
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: Q3993418
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: An Efficient Algorithm for the 0-1 Knapsack Problem
cites work: An efficient algorithm for the minimum capacity cut problem
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: Q3678962
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q4138484
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem
cites work: Finding optimum branchings
cites work: Dynamic programming algorithms for the zero-one knapsack problem
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: Solving binary cutting stock problems by column generation and branch- and-bound

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (cites work)
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (full work available at URL)
full work available at URL: s0377-2217(99)00453-1

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (OpenAlex ID)
OpenAlex ID: W2079809585