Branch-and-Bound Strategies for Dynamic Programming

Cited In (48)

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

This page was built for publication: Branch-and-Bound Strategies for Dynamic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123112)