Knapsack
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The 0-1 knapsack problem with fuzzy data
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
- Algorithmic aspects for power-efficient hardware/software partitioning
- An exact algorithm for the fixed-charge multiple knapsack problem
- The equitable dispersion problem
- A hybrid algorithm for the unbounded knapsack problem
- Heuristics for the variable sized bin-packing problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Efficient solution approaches for a discrete multi-facility competitive interaction model
- Combinatorial optimization in system configuration design
- A successive approximation algorithm for the multiple knapsack problem
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- The submodular knapsack polytope
- Inverse scheduling with maximum lateness objective
- Knapsack problems with setups
- Heuristics for the 0-1 multidimensional knapsack problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Modified subset sum heuristics for bin packing
- An exact algorithm for large multiple knapsack problems
- A fast algorithm for strongly correlated knapsack problems
- CDT
- MCTS-Solver
- HGS-CVRP
- MP-SPDZ
- Simple but efficient approaches for the collapsing knapsack problem
- A minimal algorithm for the multiple-choice knapsack problem
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Multiobjective fuzzy linear programming problems with fuzzy decision variables.
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks.
- Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.
- Discrete facility location and routing of obnoxious activities.
- Worst-case analysis of the subset sum algorithm for bin packing.
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Average performance of greedy heuristics for the integer knapsack problem.
- The computation of the worst conditional expectation.
- The multidimensional 0-1 knapsack problem: an overview.
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- TOPOS
- RAMP
- MOTGA
- MEMOTS
- VESTA
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- The nonlinear knapsack problem - algorithms and applications
- Heuristic allocation based on a dynamic programming state-space representation
- SteinLib
- CPLEX
- Integer optimization with penalized fractional values: the knapsack case
- Planning personnel retraining: column generation heuristics
- OR-Library
- New exact approaches and approximation results for the penalized knapsack problem
- Integrating dock-door assignment and vehicle routing with cross-docking
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Bi-dimensional knapsack problems with one soft constraint
- An exact approach for the 0-1 knapsack problem with setups
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- Exact approaches for the knapsack problem with setups
- A comparison of formulations and relaxations for cross-dock door assignment problems
- Combined cutting stock and lot-sizing problem with pattern setup
- On the product knapsack problem
- Exact algorithms for the bin packing problem with fragile objects
- A new fully polynomial time approximation scheme for the interval subset sum problem
- MINTO
- Randomized strategies for cardinality robustness in the knapsack problem
- Change-making problems revisited: a parameterized point of view
- Tug scheduling for hinterland barge transport: a branch-and-price approach
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Optimization methods for the train unit shunting problem
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
- An effective hybrid approach to the two-stage capacitated facility location problem
- Stony Brook
- MIPTS
- An incentive dynamic programming method for the optimization of scholarship assignment
- Lifting of probabilistic cover inequalities
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Scatter Search
- The multi-band robust knapsack problem -- a dynamic programming approach
- The packing while traveling problem
- Tolerance analysis for 0-1 knapsack problems
- An application of the multiple knapsack problem: the self-sufficient marine
- A new exact approach for the 0-1 collapsing knapsack problem
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- A dynamic reformulation heuristic for generalized interdiction problems
- An approximation algorithm for a competitive facility location problem with network effects
- Mathematical models and decomposition methods for the multiple knapsack problem
- Network pollution games
- A procedure-based heuristic for 0-1 multiple knapsack problems
This page was built for software: Knapsack
