Branch-and-Bound Strategies for Dynamic Programming

DOI10.1287/opre.24.4.611zbMath0352.90075OpenAlexW2160004927MaRDI QIDQ4123112

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.4.611

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items

A new exact algorithm for concave knapsack problems with integer variables, Exact methods for the knapsack problem and its generalizations, A tabu search experience in production scheduling, Systolic processing for dynamic programming problems, A general heuristic bottom-up procedure for searching AND/OR graphs, An improved interactive hybrid method for the linear multi-objective knapsack problem, A hybrid method for solving nonlinear knapsack problems, An exact dynamic programming algorithm for the precedence-constrained class sequencing problem, Multiple and bicriteria scheduling: A literature survey, A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times, Dynamic programming algorithms for the zero-one knapsack problem, Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, Optimal segmentation of graphs with exclusive OR nodes, Generalized dynamic programming for multicriteria optimization, Optimal deployment of logistic units in dynamic combat conditions, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, Computing shortest paths in networks derived from recurrence relations, Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming, From the theory to the tools: parallel dynamic programming, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, Single machine scheduling with flow time and earliness penalties, A dual algorithm for the one-machine scheduling problem, An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint, Dual variable based fathoming in dynamic programs for column generation, Scheduling inbound and outbound trucks at cross docking terminals, Scheduling just-in-time part supply for mixed-model assembly lines, Computational experiments with a class of dynamic programming algorithms of higher dimensions, A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem, Sequencing mixed-model assembly lines to minimize part inventory cost, Weighted network search games with multiple hidden objects and multiple search teams, A hybrid approach to discrete mathematical programming, Truck scheduling at zero-inventory cross docking terminals, A generalized knapsack problem with variable coefficients, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, A Reach and Bound algorithm for acyclic dynamic-programming networks, Heuristics and exact algorithms for solving the Monden problem, A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes, A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties, Monotonicity and the principle of optimality, A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Exact algorithm for concave knapsack problems: linear underestimation and partition method