A Dynamic Programming Approach to Sequencing Problems

Cited in

(only showing first 100 items - show all)

Nondeterministic graph searching: from pathwidth to treewidth
An exact algorithm for subgraph homeomorphism
A cutting plane procedure for the travelling salesman problem on road networks
A compact labelling scheme for series-parallel graphs
An algorithm for finding Hamilton paths and cycles in random graphs
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
Submodularity and the traveling salesman problem
On the choice of step size in subgradient optimization
A survey of scheduling methods for multiprocessor systems
Probabilistic analysis of solving the assignment problem for the traveling salesman problem
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
Hybrid algorithm for sequencing with bicriteria
On the relationship between the biconnectivity augmentation and traveling salesman problems
Dynamic programming meets the principle of inclusion and exclusion
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
A note on the effect of neighborhood structure in simulated annealing
Dynamic programming with convexity, concavity and sparsity
Optimal partitions for shop floor control in semiconductor wafer fabrication
Reduced complexity dynamic programming based on policy iteration
On estimating the number of order ideals in partial orders, with some applications
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
Four solution techniques for a general one machine scheduling problem. A comparative study
A dynamic programming formulation for the one machine sequencing problem
The Euclidean traveling salesman problem is NP-complete
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
The use of dynamic programming in genetic algorithms for permutation problems
Sevast'yanov's algorithm for the flow-shop scheduling problem
MIP modelling of changeovers in production planning and scheduling problems
Job selection and sequencing on a single machine in a random environment
Special cases of the traveling salesman problem
A dynamic programming method for single machine scheduling
Tabu search performance on the symmetric travelling salesman problem
The dynamic programming method in the generalized traveling salesman problem
The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
Greedy can beat pure dynamic programming
A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
Solving large batches of traveling salesman problems with parallel and distributed computing
On global integer extrema of real-valued box-constrained multivariate quadratic functions
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Scheduling with time-dependent discrepancy times
Finding supported paths in heterogeneous networks
Approximation schemes for the generalized traveling salesman problem
Sequencing of picking orders in mobile rack warehouses
Optimizing automated sorting in warehouses: the minimum order spread sequencing problem
Restricted dynamic programming: a flexible framework for solving realistic VRPs
Vehicle routing under time-dependent travel times: the impact of congestion avoidance
Cluster based branching for the asymmetric traveling salesman problem
Constrained spanning trees and the traveling salesman problem
A simple linear expected time algorithm for finding a Hamilton path
Embedded local search approaches for routing optimization
Solving the max-cut problem using eigenvalues
Minimizing the sum of weighted completion times with unrestricted weights
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
Exact algorithms for finding longest cycles in claw-free graphs
Truck scheduling in cross-docking terminals with fixed outbound departures
Exact algorithms for edge domination
An extremal constrained routing problem with internal losses
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Connected facility location via random facility sampling and core detouring
An alternate formulation of the symmetric traveling salesman problem and its properties
Problem of optimal choice of a route under conditions of time discounting
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
DNA origami and the complexity of Eulerian circuits with turning costs
Approximation of the double traveling salesman problem with multiple stacks
The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem
Algorithms for the metric ring star problem with fixed edge-cost ratio
Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
Computing in combinatorial optimization
Parameterized algorithms and complexity for the traveling purchaser problem and its variants
A fair-cost analysis of the random neighbor sampling method
The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
From symmetry to asymmetry: generalizing TSP approximations by parametrization
Disentangling relationships in symptom networks using matrix permutation methods
The probabilistic travelling salesman problem with crowdsourcing
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
The simultaneous semi-random model for TSP
Deep policy dynamic programming for vehicle routing problems
On the analysis of optimization problems in arc-dependent networks
Logistics planning of cash transfer to Syrian refugees in Turkey
On one approach to TSP structural stability
A new upper bound for the traveling salesman problem in cubic graphs
Scheduling just-in-time part supply for mixed-model assembly lines
Single machine scheduling with nonlinear cost functions
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
Domino sequencing: scheduling with state-based sequence-dependent setup times
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
On the fastest finite Markov processes
IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
Faster exponential-time algorithms in graphs of bounded average degree
Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards
The searching over separators strategy to solve some NP-hard problems in subexponential time
Further results on the probabilistic traveling salesman problem
Good triangulations yield good tours
Treewidth computation and extremal combinatorics

This page was built for publication: A Dynamic Programming Approach to Sequencing Problems

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