Pages that link to "Item:Q1083032"

The following pages link to Exact methods for the knapsack problem and its generalizations (Q1083032):

Displaying 35 items.

• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• On a cardinality constrained linear programming knapsack problem (Q753684) (← links)
• A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
• Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Bounds for nested knapsack problems (Q1130040) (← links)
• A note on sequencing jobs with deadlines problem (Q1194777) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
• The capacity expansion problem in the service industry (Q1321810) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
• An exact approach for scheduling jobs with regular step cost functions on a single machine (Q1762077) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• A typology of cutting and packing problems (Q1825761) (← links)
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
• Models for planning capacity expansion of convenience stores under uncertain demand and the value of information (Q1904671) (← links)
• A moment based metric for 2-D and 3-D packing (Q1971998) (← links)
• Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
• On the approximability of the two-phase knapsack problem (Q2279756) (← links)
• The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking (Q2355889) (← links)
• Knapsack allocation of multiple resources in benefit-cost analysis by way of the analytic hierarchy process (Q2365534) (← links)
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
• A versatile algorithm for assembly line balancing (Q2383104) (← links)
• The Fixed-Charge Shortest-Path Problem (Q2815469) (← links)
• Asignacion de recuerdos max-min: Propiedades y algoritmos (Q3354440) (← links)
• Relaxation techniques applied to some loading problems (Q4327925) (← links)
• (Q5005149) (← links)
• Binary Optimal Control of Single-Flux-Quantum Pulse Sequences (Q5047936) (← links)
• (Q5090348) (← links)