scientific article; zbMATH DE number 1302173
From MaRDI portal
Publication:4247440
Recommendations
Cited in
(68)- A successive approximation algorithm for the multiple knapsack problem
- Knapsack problems with setups
- The complexity of the 0/1 multi-knapsack problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Average performance of greedy heuristics for the integer knapsack problem.
- Approximation algorithms for knapsack problems with cardinality constraints
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Knapsack
- The packing while traveling problem
- Where are the hard knapsack problems?
- Computing knapsack solutions with cardinality robustness
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- An efficient algorithm of dead-end controls for solving combinatorial optimization problems
- Reinforcement learning for the knapsack problem
- Cooperative and axiomatic approaches to the knapsack allocation problem
- Multistage knapsack
- A new class of hard problem instances for the 0-1 knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Multiple-choice knapsack constraint in graphical models
- Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators
- The knapsack problem with forfeits
- Two-group knapsack game
- On combinatorial properties of the knapsack problem
- Knapsack problem with objective value gaps
- Knapsack problems: a parameterized point of view
- An exact algorithm for the knapsack sharing problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Algorithms for some hard knapsack problems
- Experiments with the ``Oregon Trail knapsack problem
- Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
- scientific article; zbMATH DE number 4160465 (Why is no real title available?)
- A survey of effective heuristics and their application to a variety of knapsack problems
- A Knapsack Secretary Problem with Applications
- Technical Note—Some Very Easy Knapsack/Partition Problems
- scientific article; zbMATH DE number 3989108 (Why is no real title available?)
- scientific article; zbMATH DE number 4023019 (Why is no real title available?)
- A hard knapsack problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 698819 (Why is no real title available?)
- scientific article; zbMATH DE number 1546499 (Why is no real title available?)
- scientific article; zbMATH DE number 1783857 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Factorization length distribution for affine semigroups. III: Modular equidistribution for numerical semigroups with arbitrarily many generators
- Elasticity in Apéry sets
- 0-1 knapsack problems with a side constraint
- The Temporal Knapsack Problem and Its Solution
- Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
- Random knapsack in expected polynomial time
- An exact algorithm for the subset sum problem
- Lagrangian heuristics for the quadratic knapsack problem
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems
- Yet harder knapsack problems
- Global optimality conditions and optimization methods for quadratic knapsack problems
- Branch-and-bound and dynamic programming approaches for the knapsack problem
- Geometric Knapsack problems
- An improved FPTAS for budgeted laminar matroid independent set
- Discrete location problems with push-pull objectives
- Overcoming poor data quality: optimizing validation of precedence relation data
- The zone hopping problem
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- An optimization algorithm for the clearing of interbank payments
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Multiattribute electronic procurement using goal programming
- Nonconvex piecewise linear knapsack problems
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247440)
