Knapsack
From MaRDI portal
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)
- Efficient oracles for generating binary bubble languages
- Inverse scheduling with maximum lateness objective
- 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
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Minimal cost reconfiguration of data placement in a storage area network
- Bounding the running time of algorithms for scheduling and packing problems
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Parallel simulation of multiphase flows using octree adaptivity and the volume-of-fluid method
- Summarizing transactional databases with overlapped hyperrectangles
- Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks.
- Bin packing with general cost structures
- Random knapsack in expected polynomial time
- An optimization framework for ``build-or-buy decisions in software architecture
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Greedy algorithm for the general multidimensional knapsack problem
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- Tight bounds for online class-constrained packing
- Exactly solving a two-level location problem with modular node capacities
- Truthful approximation mechanisms for restricted combinatorial auctions
- Approximate and exact algorithms for the fixed-charge knapsack problem
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Minimum and worst-case performance ratios of rollout algorithms
- Integer knapsack problems with set-up weights
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
- Two-group knapsack game
- On two class-constrained versions of the multiple knapsack problem
- Approximation schemes for knapsack problems with shelf divisions
- An empirical investigation on parallelization strategies for scatter search
- The constrained compartmentalised knapsack problem
- A hybrid algorithm for the unbounded knapsack problem
- Average performance of greedy heuristics for the integer knapsack problem.
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- A fast algorithm for strongly correlated knapsack problems
- Two-machine shop scheduling: Compromise between flexibility and makespan value
- An implementation of exact knapsack separation
- Choquet optimal set in biobjective combinatorial optimization
- Generalized quadratic multiple knapsack problem and two solution approaches
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse
- Integrated model for software component selection with simultaneous consideration of implementation and verification
- Determining the \(K\)-best solutions of knapsack problems
- A dynamic programming algorithm for the knapsack problem with setup
- Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- An exact method with variable fixing for solving the generalized assignment problem
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- The one dimensional Compartmentalised Knapsack problem: a case study
- On the complexity of working set selection
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions
- A hub location problem with fully interconnected backbone and access networks
- A GRASP-based approach for technicians and interventions scheduling for telecommunications
- A branch-and-bound algorithm for hard multiple knapsack problems
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- An exact algorithm for cost minimization in series reliability systems with multiple component choices
- Branch-and-cut-and-price for capacitated connected facility location
- A computational study of exact knapsack separation for the generalized assignment problem
- There is no EPTAS for two-dimensional knapsack
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Two-stage general block patterns for the two-dimensional cutting problem
- A new lower bound for the linear knapsack problem with general integer variables
- Competitive facility location model with concave demand
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
- Efficient solution approaches for a discrete multi-facility competitive interaction model
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Motion planning with pulley, rope, and baskets
- Using fuzzy numbers in knapsack problems
- The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Reoptimizing the 0-1 knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- Parameterized approximation scheme for the multiple knapsack problem
- Online removable knapsack with limited cuts
- 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
This page was built for software: Knapsack
