scientific article; zbMATH DE number 1302173
From MaRDI portal
Publication:4247440
zbMATH Open0924.90120MaRDI QIDQ4247440FDOQ4247440
Authors: David Pisinger, Paolo Toth 
Publication date: 16 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Boolean programming (90C09)
Cited In (65)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems
- Title not available (Why is that?)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Title not available (Why is that?)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators
- The knapsack problem with forfeits
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- Technical Note—Some Very Easy Knapsack/Partition Problems
- A new class of hard problem instances for the 0-1 knapsack problem
- Random knapsack in expected polynomial time
- Geometric Knapsack problems
- Multistage knapsack
- An exact algorithm for the subset sum problem
- Two-group knapsack game
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factorization length distribution for affine semigroups. III: Modular equidistribution for numerical semigroups with arbitrarily many generators
- Knapsack problem with objective value gaps
- Where are the hard knapsack problems?
- Average performance of greedy heuristics for the integer knapsack problem.
- Lagrangian heuristics for the quadratic knapsack problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A hard knapsack problem
- A successive approximation algorithm for the multiple knapsack problem
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Global optimality conditions and optimization methods for quadratic knapsack problems
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
- Discrete location problems with push-pull objectives
- Experiments with the ``Oregon Trail knapsack problem
- Title not available (Why is that?)
- Knapsack
- Algorithms for some hard knapsack problems
- Multiattribute electronic procurement using goal programming
- Knapsack problems: a parameterized point of view
- The zone hopping problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Nonconvex piecewise linear knapsack problems
- The Temporal Knapsack Problem and Its Solution
- Multiple-choice knapsack constraint in graphical models
- \(0\)-\(1\) knapsack problems with a side constraint
- The complexity of the 0/1 multi-knapsack problem
- On combinatorial properties of the knapsack problem
- Computing knapsack solutions with cardinality robustness
- Knapsack problems with setups
- An efficient algorithm of dead-end controls for solving combinatorial optimization problems
- Title not available (Why is that?)
- A survey of effective heuristics and their application to a variety of knapsack problems
- Yet harder knapsack problems
- An exact algorithm for the knapsack sharing problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Title not available (Why is that?)
- Reinforcement learning for the knapsack problem
- A Knapsack Secretary Problem with Applications
- Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem
- An optimization algorithm for the clearing of interbank payments
- The packing while traveling problem
- Cooperative and axiomatic approaches to the knapsack allocation problem
- Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
- Elasticity in Apéry sets
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)
