Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …
(2004), knapsack problems became a classical and rich research area in combinatorial …
Chance-constrained binary packing problems
We consider a class of packing problems with uncertain data, which we refer to as the
chance-constrained binary packing problem. In this problem, a subset of items is selected …
chance-constrained binary packing problem. In this problem, a subset of items is selected …
Joint routing and scheduling for large-scale deterministic IP networks
With the advent of 5G and the evolution of Internet protocols, industrial applications are
moving from vertical solutions to general purpose IP-based infrastructures that need to meet …
moving from vertical solutions to general purpose IP-based infrastructures that need to meet …
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1
Linear Programming problems. To generate such inequalities, one needs separation …
Linear Programming problems. To generate such inequalities, one needs separation …
Knapsack polytopes: a survey
C Hojny, T Gally, O Habeck, H Lüthen, F Matter… - Annals of Operations …, 2020 - Springer
The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy a given single
linear inequality with non-negative coefficients. This paper provides a comprehensive …
linear inequality with non-negative coefficients. This paper provides a comprehensive …
Coral: An exact algorithm for the multidimensional knapsack problem
The multidimensional knapsack problem (MKP) is a well-known, strongly NP-hard problem
and one of the most challenging problems in the class of the knapsack problems. In the last …
and one of the most challenging problems in the class of the knapsack problems. In the last …
Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
The lift-gas allocation problem with well-separator routing constraints is a mixed-integer
nonlinear program of considerable complexity. To this end, a mixed-integer linear …
nonlinear program of considerable complexity. To this end, a mixed-integer linear …
Chance-constrained multiple bin packing problem with an application to operating room planning
We study the chance-constrained bin packing problem, with an application to hospital
operating room planning. The bin packing problem allocates items of random sizes that …
operating room planning. The bin packing problem allocates items of random sizes that …
An exact algorithm for a rich vehicle routing problem with private fleet and common carrier
The vehicle routing problem with private fleet and common carrier (VRPPC) is a
generalization of the classical vehicle routing problem in which the owner of a private fleet …
generalization of the classical vehicle routing problem in which the owner of a private fleet …
Mathematical Models and Search Algorithms for the Capacitated -Center Problem
The capacitated p-center problem requires one to select p facilities from a set of candidates
to service a number of customers, subject to facility capacity constraints, with the aim of …
to service a number of customers, subject to facility capacity constraints, with the aim of …