Knapsack
From MaRDI portal
Software:16891
No author found.
Related Items (only showing first 100 items - show all)
Approximation schemes for knapsack problems with shelf divisions ⋮ An optimization algorithm for the clearing of interbank payments ⋮ 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 ⋮ A dynamic programming algorithm for the bilevel Knapsack problem ⋮ Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem ⋮ The Subset Sum game ⋮ An adaptive stochastic knapsack problem ⋮ Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ Matroid and knapsack center problems ⋮ Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem ⋮ Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem ⋮ The linking set problem: a polynomial special case of the multiple-choice knapsack problem ⋮ An efficient approximation for the generalized assignment problem ⋮ A generalization of column generation to accelerate convergence ⋮ Decomposition based hybrid metaheuristics ⋮ An approach to the asymmetric multi-depot capacitated arc routing problem ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ An exact decomposition algorithm for the generalized knapsack sharing problem ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Asymptotic behavior of the quadratic knapsack problem ⋮ An implementation of exact knapsack separation ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ Exact solution of the robust knapsack problem ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ Rapid calculation of exact cell bounds for contingency tables from conditional frequencies ⋮ Multiattribute electronic procurement using goal programming ⋮ Integrated model for software component selection with simultaneous consideration of implementation and verification ⋮ A new lower bound for the linear knapsack problem with general integer variables ⋮ Determining the \(K\)-best solutions of knapsack problems ⋮ A dynamic programming algorithm for the knapsack problem with setup ⋮ Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation ⋮ Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization ⋮ Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ LP based heuristics for the multiple knapsack problem with assignment restrictions ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ Simplest optimal cutting patterns for equal rectangles ⋮ Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions ⋮ The constrained compartmentalised knapsack problem ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Tight bounds for online class-constrained packing ⋮ Optimal partial hedging in a discrete-time market as a Knapsack problem ⋮ Reoptimizing the 0-1 knapsack problem ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Summarizing transactional databases with overlapped hyperrectangles ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ Online removable knapsack with limited cuts ⋮ Approximation schemes for generalized two-dimensional vector packing with application to data placement ⋮ Minimum and worst-case performance ratios of rollout algorithms ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ Efficient oracles for generating binary bubble languages ⋮ Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ Kernel search: a new heuristic framework for portfolio selection ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ A QoS-aware composition method supporting cross-platform service invocation in cloud environment ⋮ A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems ⋮ Committee selection under weight constraints ⋮ An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable ⋮ Optimal sequential inspection policies ⋮ Column generation for extended formulations ⋮ Selfish bin covering ⋮ Global optimality conditions and optimization methods for quadratic knapsack problems ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ Lock-free parallel dynamic programming ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ A new effective dynamic program for an investment optimization problem ⋮ Order acceptance and scheduling with consideration of service level ⋮ Minimal cost reconfiguration of data placement in a storage area network ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ On reduction of duality gap in quadratic knapsack problems ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ An exact method with variable fixing for solving the generalized assignment problem ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ Discrete location problems with push-pull objectives ⋮ Semi-definite relaxation algorithm of multiple knapsack problem ⋮ Optimization models for targeted offers in direct marketing: exact and heuristic algorithms ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ A GRASP-based approach for technicians and interventions scheduling for telecommunications ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem ⋮ Parallel simulation of multiphase flows using octree adaptivity and the volume-of-fluid method ⋮ Heuristic algorithms for the general nonlinear separable knapsack problem ⋮ Stochastic set packing problem ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ Hard multidimensional multiple choice knapsack problems, an empirical study ⋮ Greedy algorithms for the minimization knapsack problem: average behavior ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach ⋮ There is no EPTAS for two-dimensional knapsack ⋮ Exact solution of a class of nonlinear knapsack problems ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects
This page was built for software: Knapsack
