Pages that link to "Item:Q1245074"

The following pages link to An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074):

Displaying 48 items.

• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships (Q556008) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• The selective travelling salesman problem (Q910347) (← links)
• An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
• Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
• A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
• The zero-one knapsack problem with equality constraint (Q1058453) (← links)
• Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
• The bound improving sequence algorithm (Q1061001) (← links)
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• An integer programming model for the allocation of databases in a distributed computer system (Q1083877) (← links)
• A new enumeration scheme for the knapsack problem (Q1095029) (← links)
• Solution of a tinned iron purchasing problem by Lagrangean relaxation (Q1130077) (← links)
• Solving the optimal network problem (Q1135216) (← links)
• Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
• Solution of the zero-one multiple knapsack problem (Q1142701) (← links)
• A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514) (← links)
• Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
• An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth (Q1247256) (← links)
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
• The inverse-parametric knapsack problem (Q1388831) (← links)
• New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• Exact approaches for the knapsack problem with setups (Q1652523) (← links)
• Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
• Formulating and solving production planning problems (Q1806882) (← links)
• On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
• A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
• Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study (Q2883592) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
• A heuristic routine for solving large loading problems (Q3962774) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058) (← links)
• Foundations of operations research: from linear programming to data envelopment analysis (Q6106760) (← links)
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)