Knapsack
From MaRDI portal
Software:16891
swMATH4723MaRDI QIDQ16891FDOQ16891
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- 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
- Title not available (Why is that?)
- Exact solution of the robust knapsack problem
- Worst-case analysis of the subset sum algorithm for bin packing.
- An adaptive stochastic knapsack problem
- The Subset Sum game
- Matroid and knapsack center problems
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Kernel search: a new heuristic framework for portfolio selection
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Where are the hard knapsack problems?
- On the advice complexity of the knapsack problem
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Budgeting with bounded multiple-choice constraints.
- A dynamic programming algorithm for the bilevel Knapsack problem
- Decomposition based hybrid metaheuristics
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- A branch-and-price algorithm for the capacitated facility location 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
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Exact algorithm for bi-objective 0-1 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
- Heuristics for the variable sized bin-packing problem
- Knapsack problems: a parameterized point of view
- A minimal algorithm for the multiple-choice knapsack problem
- An improved typology of cutting and packing problems
- Discrete facility location and routing of obnoxious activities.
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Approximation algorithms for knapsack problems with cardinality constraints
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- The equitable dispersion problem
- Heuristics for the 0-1 multidimensional knapsack problem
- Separation algorithms for 0-1 knapsack polytopes
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Measuring instance difficulty for combinatorial optimization problems
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- A survey of recent developments in multiobjective optimization
- Capacity allocation and scheduling in supply chains
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- A computational comparison of flow formulations for the capacitated location-routing problem
- The nonlinear knapsack problem - algorithms and applications
- Stochastic binary problems with simple penalties for capacity constraints violations
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- The multidimensional 0-1 knapsack problem: an overview.
- Heuristics for the container loading problem
- Integrating dock-door assignment and vehicle routing with cross-docking
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- An exact algorithm for large multiple knapsack problems
- Lot sizing with carbon emission constraints
- A survey of effective heuristics and their application to a variety of knapsack problems
- Compact bidding languages and supplier selection for markets with economies of scale and scope
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- An exact algorithm for the knapsack sharing problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- An integrated cutting stock and sequencing problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- The multidimensional knapsack problem: structure and algorithms
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- A cross entropy algorithm for the Knapsack problem with setups
- A cutting plane method for knapsack polytope
This page was built for software: Knapsack
