Results 171 to 180 of about 28,490 (215)
Some of the next articles are maybe not open access.
2016
This chapter revisits a maximization problem that was already briefly studied in Chap. 1 in the context of approximation algorithms.
T. C. Hu, Andrew B. Kahng
openaire +2 more sources
This chapter revisits a maximization problem that was already briefly studied in Chap. 1 in the context of approximation algorithms.
T. C. Hu, Andrew B. Kahng
openaire +2 more sources
2011
Knapsack problem is a classical optimization problem. It is widely used in resource allocation problems. We are aware of 0-1 knapsack and fractional knapsack problem. Here, we will discuss about a newer version, unified knapsack problem, which is a combination of above two versions.
Umesh Chandra Jaiswal +3 more
openaire +1 more source
Knapsack problem is a classical optimization problem. It is widely used in resource allocation problems. We are aware of 0-1 knapsack and fractional knapsack problem. Here, we will discuss about a newer version, unified knapsack problem, which is a combination of above two versions.
Umesh Chandra Jaiswal +3 more
openaire +1 more source
Multidimensional Knapsack Problems
2004In this first chapter of extensions and generalizations of the basic knapsack problem (KP) we will add additional constraints to the single weight constraint (1.2) thus attaining the multidimensional knapsack problem. After the introduction we will deal extensively with relaxations and reductions in Section 9.2.
Hans Kellerer +2 more
openaire +1 more source
2000
The MINIMUM WEIGHT PERFECT MATCHING PROBLEM and the WEIGHTED MATROID INTERSECTION PROBLEM discussed in earlier chapters are among the “hardest” problems for which a polynomial-time algorithm is known. In this chapter we deal with the following problem which turns out to be, in a sense, the “easiest” NP-hard problem:
Bernhard Korte, Jens Vygen
openaire +1 more source
The MINIMUM WEIGHT PERFECT MATCHING PROBLEM and the WEIGHTED MATROID INTERSECTION PROBLEM discussed in earlier chapters are among the “hardest” problems for which a polynomial-time algorithm is known. In this chapter we deal with the following problem which turns out to be, in a sense, the “easiest” NP-hard problem:
Bernhard Korte, Jens Vygen
openaire +1 more source
2004
In this chapter we consider knapsack type problems which have not been investigated in the preceding chapters. There is a huge amount of different kinds of variations of the knapsack problem in the scientific literature, often a specific problem is treated in only one or two papers. Thus, we could not include every knapsack variant but we tried to make
Hans Kellerer +2 more
openaire +1 more source
In this chapter we consider knapsack type problems which have not been investigated in the preceding chapters. There is a huge amount of different kinds of variations of the knapsack problem in the scientific literature, often a specific problem is treated in only one or two papers. Thus, we could not include every knapsack variant but we tried to make
Hans Kellerer +2 more
openaire +1 more source
2012
Das MINIMUM-WEIGHT-PERFECT-MATCHING-PROBLEM und das GEWICHTETE MATROID-INTERSEKTIONS-PROBLEM, die beide in vorausgegangenen Kapiteln besprochen worden sind, gehoren zu den „schwersten“ Problemen, fur die ein polynomieller Algorithmus bekannt ist.
Bernhard Korte, Jens Vygen
openaire +1 more source
Das MINIMUM-WEIGHT-PERFECT-MATCHING-PROBLEM und das GEWICHTETE MATROID-INTERSEKTIONS-PROBLEM, die beide in vorausgegangenen Kapiteln besprochen worden sind, gehoren zu den „schwersten“ Problemen, fur die ein polynomieller Algorithmus bekannt ist.
Bernhard Korte, Jens Vygen
openaire +1 more source
The continuous collapsing Knapsack problem
Mathematical Programming, 1983A Collapsing Knapsack is a container whose capacity diminishes as the number of items it must hold is increased. This paper focuses on those cases in which the decision variables are continuous, i.e., can take any non-negative value. It is demonstrated that the problem can be reduced to a set of two dimensional subproblems.
openaire +1 more source
2008
Alice and Bob were excited about the bicycle tour they had long planned. They were going to ride during the day, carrying only light supplies, and stay in hotels at night. Alice had suggested they coordinate packing to avoid duplication and extra weight.
openaire +1 more source
Alice and Bob were excited about the bicycle tour they had long planned. They were going to ride during the day, carrying only light supplies, and stay in hotels at night. Alice had suggested they coordinate packing to avoid duplication and extra weight.
openaire +1 more source