Pages that link to "Item:Q4123112"
From MaRDI portal
The following pages link to Branch-and-Bound Strategies for Dynamic Programming (Q4123112):
Displaying 44 items.
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208) (← links)
- Single machine scheduling with flow time and earliness penalties (Q686991) (← links)
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
- Dual variable based fathoming in dynamic programs for column generation (Q707137) (← links)
- Truck scheduling at zero-inventory cross docking terminals (Q733516) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- Generalized dynamic programming for multicriteria optimization (Q908857) (← links)
- Sequencing mixed-model assembly lines to minimize part inventory cost (Q991825) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- Systolic processing for dynamic programming problems (Q1099090) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
- Optimal segmentation of graphs with exclusive OR nodes (Q1154276) (← links)
- Optimal deployment of logistic units in dynamic combat conditions (Q1158102) (← links)
- Computing shortest paths in networks derived from recurrence relations (Q1179746) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
- Heuristics and exact algorithms for solving the Monden problem (Q1266568) (← links)
- A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes (Q1266643) (← links)
- An improved interactive hybrid method for the linear multi-objective knapsack problem (Q1374024) (← links)
- Monotonicity and the principle of optimality (Q1838705) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Scheduling inbound and outbound trucks at cross docking terminals (Q2267379) (← links)
- Scheduling just-in-time part supply for mixed-model assembly lines (Q2275595) (← links)
- Computational experiments with a class of dynamic programming algorithms of higher dimensions (Q2277161) (← links)
- A tabu search experience in production scheduling (Q2366998) (← links)
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties (Q2563872) (← links)
- A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
- A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
- A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- A generalized knapsack problem with variable coefficients (Q4173196) (← links)
- From the theory to the tools: parallel dynamic programming (Q4487154) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)