Cited in
(only showing first 100 items - show all)- An optimization algorithm for a penalized knapsack problem
- On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization
- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- Parallel time and space upper-bounds for the subset-sum problem
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Efficient oracles for generating binary bubble languages
- A heuristic for the problem of one-dimensional steel coil cutting
- Two-dimensional knapsack-block packing problem
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Elasticity in Apéry sets
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Inverse scheduling with maximum lateness objective
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- A minimal algorithm for the bounded knapsack problem
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Optimal genetic screening for cystic fibrosis
- An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Solving bin packing problems using VRPSolver models
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Lifting of probabilistic cover inequalities
- A multi-period network design problem for cellular telecommunication systems
- Multiple objective optimization and implications for single objective optimization.
- 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
- Multiobjective fuzzy linear programming problems with fuzzy decision variables.
- Faster algorithms for \(k\)-subset sum and variations
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- 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
- Minimal cost reconfiguration of data placement in a storage area network
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- Reliability aware scheduling of bag of real time tasks in cloud environment
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Simple but efficient approaches for the collapsing knapsack problem
- An improved linearization strategy for zero-one quadratic programming problems
- Core problems in knapsack algorithms
- Algorithms for the bounded set-up knapsack problem
- LP based heuristics for the multiple knapsack problem with assignment restrictions
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Parallel simulation of multiphase flows using octree adaptivity and the volume-of-fluid method
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- Lower and upper bounds for the bin packing problem with fragile objects
- Combinatorial optimization problems in wireless switch design
- On the hardness of energy minimisation for crystal structure prediction
- Solution of large quadratic knapsack problems through aggressive reduction
- Summarizing transactional databases with overlapped hyperrectangles
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals
- A new variable reduction technique for convex integer quadratic programs
- Bounding the running time of algorithms for scheduling and packing problems
- Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks.
- An exact algorithm for bilevel 0-1 knapsack problems
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- On reduction of duality gap in quadratic knapsack problems
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- The bilevel knapsack problem with stochastic right-hand sides
- Semi-definite relaxation algorithm of multiple knapsack problem
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators
- A comparison of formulations and relaxations for cross-dock door assignment problems
- Exact algorithm for generating two-segment cutting patterns of punched strips
- A new class of hard problem instances for the 0-1 knapsack problem
- Bin packing with general cost structures
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- scientific article; zbMATH DE number 2050743 (Why is no real title available?)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- An optimization framework for ``build-or-buy decisions in software architecture
- Tight bounds for online class-constrained packing
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- The multi-band robust knapsack problem -- a dynamic programming approach
- An efficient approximation for the generalized assignment problem
- Random knapsack in expected polynomial time
- Greedy algorithm for the general multidimensional knapsack problem
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
- An efficient algorithm for the collapsing knapsack problem
- Truthful approximation mechanisms for restricted combinatorial auctions
- Exactly solving a two-level location problem with modular node capacities
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Minimum and worst-case performance ratios of rollout algorithms
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- Approximating subset sum ratio via subset sum computations
- Approximate and exact algorithms for the fixed-charge knapsack problem
- On the exact separation of cover inequalities of maximum-depth
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
- Robust online algorithms for dynamic choosing problems
- Design and performance evaluation of contentplace, a social-aware data dissemination system for opportunistic networks
- Multistage knapsack
This page was built for software: Knapsack
