Pages that link to "Item:Q1569935"
From MaRDI portal
The following pages link to New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935):
Displaying 50 items.
- An adaptive stochastic knapsack problem (Q297367) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Optimal partial hedging in a discrete-time market as a Knapsack problem (Q607677) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Exact solution of a class of nonlinear knapsack problems (Q813968) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- The 0-1 knapsack problem with fuzzy data (Q1001155) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- The computation of the worst conditional expectation. (Q1427561) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Heuristic allocation based on a dynamic programming state-space representation (Q1602778) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- A comparison of formulations and relaxations for cross-dock door assignment problems (Q1652605) (← links)
- Tug scheduling for hinterland barge transport: a branch-and-price approach (Q1681331) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Solving knapsack problems on GPU (Q1761942) (← links)
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- The binary knapsack problem with qualitative levels (Q2029032) (← links)
- A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
- Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- Cooperative and axiomatic approaches to the knapsack allocation problem (Q2095938) (← links)
- Smallest covering regions and highest density regions for discrete distributions (Q2155016) (← links)
- Sensor network optimization of gearbox based on dependence matrix and improved discrete shuffled frog leaping algorithm (Q2311277) (← links)
- Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
- An experimental study of random knapsack problems (Q2369879) (← links)
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- Tree knapsack approaches for local access network design (Q2503262) (← links)
