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)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- Parallel time and space upper-bounds for the subset-sum problem
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Simple but efficient approaches for the collapsing knapsack problem
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- LP based heuristics for the multiple knapsack problem with assignment restrictions
- Combinatorial optimization problems in wireless switch design
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- Exact algorithm for generating two-segment cutting patterns of punched strips
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- Combined cutting stock and lot-sizing problem with pattern setup
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem
- An exact algorithm for the subset sum problem
- Inversion of convection-diffusion equation with discrete sources
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Orbital shrinking: theory and applications
- Simplest optimal cutting patterns for equal rectangles
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined
- Greedy algorithms for the minimization knapsack problem: average behavior
- Approximation and online algorithms for multidimensional bin packing: a survey
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- Tree knapsack approaches for local access network design
- Admission control in computer networks with uncertain parameters
- Packing resizable items with application to video delivery over wireless networks
- Algorithms and Computation
- CORAL: an exact algorithm for the multidimensional knapsack problem
- A new heuristic algorithm for the one-dimensional cutting stock problem
- Black box scatter search for general classes of binary optimization problems
- The knapsack problem with neighbour constraints
- A generalization of column generation to accelerate convergence
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- An experimental study of random knapsack problems
- Qos-aware service evaluation and selection
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Title not available (Why is that?)
- Approximation Algorithms for 3D Orthogonal Knapsack
- On the product knapsack problem
- An optimization algorithm for the clearing of interbank payments
- The packing while traveling problem
- MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem
- On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Lower and upper bounds for the bin packing problem with fragile objects
- A Minimal Algorithm for the 0-1 Knapsack Problem
- An efficient approximation for the generalized assignment problem
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Modified subset sum heuristics for bin packing
- Robust optimization approach for a chance-constrained binary knapsack problem
- Exact solution of the robust knapsack problem
- Worst-case analysis of the subset sum algorithm for bin packing.
- Where are the hard knapsack problems?
- On the advice complexity of the knapsack problem
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- A successive approximation algorithm for the multiple knapsack problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- MINTO
- MIPTS
- Scatter Search
- Stony Brook
- kappalab
- VIFF
- mkc7
- MULKNAP
- MADM
- RACT
- MENU-OKF
- MOD-DIST
- SITATION
- Knapsack problems: a parameterized point of view
- HyFlex
- SDP_S
- ADBASE
- Tabu search
- BaPCod
- BBMCL
- CVRPSP
- emoa
- SALBPGen
- CUTGEN1
- GOAL
- Hyperion
- A minimal algorithm for the multiple-choice knapsack problem
- K_TREE/K_SUBGRAPH
- Ckmeans.1d.dp
- Bison
- CABOB
- An improved typology of cutting and packing problems
This page was built for software: Knapsack
