swMATH4723MaRDI QIDQ16891FDOQ16891
Author name not available (Why is that?)
Official website: http://www.diku.dk/~pisinger/codes.html
Cited In (only showing first 100 items - show all)
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Core problems in knapsack algorithms
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- Solution of large quadratic knapsack problems through aggressive reduction
- Title not available (Why is that?)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- An adaptive stochastic knapsack problem
- The Subset Sum game
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A Minimal Algorithm for the Bounded Knapsack Problem
- Exact Solution of the Quadratic Knapsack Problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Kernel search: a new heuristic framework for portfolio selection
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Budgeting with bounded multiple-choice constraints.
- A dynamic programming algorithm for the bilevel Knapsack problem
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Decomposition based hybrid metaheuristics
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- A branch-and-price algorithm for the capacitated facility location problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Exact algorithm for bi-objective 0-1 knapsack problem
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Asymptotic behavior of the quadratic knapsack problem
- Robust efficiency measures for linear knapsack problem variants
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- Discrete location problems with push-pull objectives
- Heuristics for the variable sized bin-packing problem
- Exact solution of a class of nonlinear knapsack problems
- SearchCol
- Nonconvex piecewise linear knapsack problems
- Recoverable robust knapsacks: the discrete scenario case
- The equitable dispersion problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Model and algorithms for multi-period sea cargo mix problem
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- Capacity allocation and scheduling in supply chains
- The nonlinear knapsack problem - algorithms and applications
- An improved binary search algorithm for the multiple-choice knapsack problem
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- The multidimensional 0-1 knapsack problem: an overview.
- Heuristics for the container loading problem
- Integrating dock-door assignment and vehicle routing with cross-docking
- The submodular knapsack polytope
- Complexity of strategic behavior in multi-winner elections
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Heuristic allocation based on a dynamic programming state-space representation
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- A dynamic reformulation heuristic for generalized interdiction problems
- A computational study on the quadratic knapsack problem with multiple constraints
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Solving knapsack problems on GPU
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- An exact algorithm for the knapsack sharing problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- The quadratic 0-1 knapsack problem with series-parallel support
- A dynamic programming heuristic for the quadratic knapsack problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- An integrated cutting stock and sequencing problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- The multidimensional knapsack problem: structure and algorithms
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- New upper bounds and exact methods for the knapsack sharing problem
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
- Efficient oracles for generating binary bubble languages
- Inverse scheduling with maximum lateness objective
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- A cross entropy algorithm for the Knapsack problem with setups
- A cutting plane method for knapsack polytope
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- An improved linearization strategy for zero-one quadratic programming problems
- Algorithms for the bounded set-up knapsack problem
This page was built for software: Knapsack
