Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967): Difference between revisions

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