The following pages link to Knapsack (Q16891):
Displaying 50 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- The Subset Sum game (Q296979) (← links)
- An adaptive stochastic knapsack problem (Q297367) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- Integrated model for software component selection with simultaneous consideration of implementation and verification (Q339707) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization (Q342154) (← links)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions (Q357176) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
- Online removable knapsack with limited cuts (Q410717) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Efficient oracles for generating binary bubble languages (Q426808) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Kernel search: a new heuristic framework for portfolio selection (Q434181) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A QoS-aware composition method supporting cross-platform service invocation in cloud environment (Q439983) (← links)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
- Committee selection under weight constraints (Q449043) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Order acceptance and scheduling with consideration of service level (Q513576) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- A GRASP-based approach for technicians and interventions scheduling for telecommunications (Q542005) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Parallel simulation of multiphase flows using octree adaptivity and the volume-of-fluid method (Q553232) (← links)
