A Dynamic Programming Approach to Sequencing Problems

Cited in

(only showing first 100 items - show all)

Distance conserving reductions for nonoriented networks
Solving a routing problem with the aid of an independent computations scheme
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Sparktope: linear programs from algorithms
From symmetry to asymmetry: generalizing TSP approximations by parametrization
Disentangling relationships in symptom networks using matrix permutation methods
A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
The travelling salesman problem: selected algorithms and heuristics†
The routing problems with optimization of the starting point: dynamic programming
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
Dynamic programming with convexity, concavity and sparsity
Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
The single robot line coverage problem: Theory, algorithms, and experiments
Exact algorithms for single-machine scheduling with time windows and precedence constraints
A note on the effect of neighborhood structure in simulated annealing
A survey of scheduling methods for multiprocessor systems
Invitation to Algorithmic Uses of Inclusion–Exclusion
Cluster based branching for the asymmetric traveling salesman problem
Faster exponential-time algorithms in graphs of bounded average degree
Vehicle routing under time-dependent travel times: the impact of congestion avoidance
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
The probabilistic travelling salesman problem with crowdsourcing
scientific article; zbMATH DE number 7559398 (Why is no real title available?)
Computing treewidth on the GPU
A new upper bound for the traveling salesman problem in cubic graphs
On the complexity of dynamic programming for sequencing problems with precedence constraints
Solving large batches of traveling salesman problems with parallel and distributed computing
An exact iterative search algorithm for constrained Markov decision processes
End-vertices of graph search algorithms
Edge elimination in TSP instances
The simultaneous semi-random model for TSP
On estimating the number of order ideals in partial orders, with some applications
Approximate and randomized algorithms for computing a second Hamiltonian cycle
Designing group behavior algorithms for autonomous underwater vehicles in the underwater local heterogeneities survey problem
Cyclic inventory routing in a line-shaped network
The bi-objective mixed capacitated general routing problem with different route balance criteria
A new graph model and algorithms for consistent superstring problems
A mathematical model for supply chain management of blood banks in India
A geometrical method in combinatorial complexity
Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem
The deterministic product location problem under a pick-by-order policy
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
MIP modelling of changeovers in production planning and scheduling problems
Reinforcement learning for combinatorial optimization: a survey
The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals
Optimization of the start point in the GTSP with the precedence conditions
Sign depth tests in multiple regression
Some constrained shortest-route problems
The traveling purchaser problem with stochastic prices: exact and approximate algorithms
Job shop scheduling with setup times, deadlines and precedence constraints
An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
Good triangulations yield good tours
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
Solving the job-shop scheduling problem optimally by dynamic programming
Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
Material allocation in MRP with tardiness penalties
Single machine scheduling with nonlinear cost functions
An exact algorithm for the minimum dominating clique problem
Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
Word reordering and a dynamic programming beam search algorithm for statistical machine translation
Sevast'yanov's algorithm for the flow-shop scheduling problem
The simultaneous semi-random model for TSP
Optimizing multi-inserts in routing problems with constraints
Vehicle routing on road networks: how good is Euclidean approximation?
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
scientific article; zbMATH DE number 7232792 (Why is no real title available?)
Algorithms for the metric ring star problem with fixed edge-cost ratio
Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
Exact Algorithms for Edge Domination
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
Treewidth and pathwidth parameterized by the vertex cover number
Time complexity of the analyst's traveling salesman algorithm
Exact solution procedures for the balanced unidirectional cyclic layout problem
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Dominance rules in combinatorial optimization problems
Energy minimizing order picker forklift routing problem
A dynamic programming method for single machine scheduling
On cutwidth parameterized by vertex cover
On routing problem with starting point optimization
Truck scheduling in cross-docking terminals with fixed outbound departures
Solution of large-scale symmetric travelling salesman problems
Some optimal path problems subject to improvements
Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
Dynamic programming approach to the single-machine sequencing problem with different due-dates
GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem
A 3/2-Approximation for the Metric Many-Visits Path TSP
On the choice of step size in subgradient optimization
On cutwidth parameterized by vertex cover
On the relationship between the biconnectivity augmentation and traveling salesman problems
On global integer extrema of real-valued box-constrained multivariate quadratic functions
In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers' walking effort
When polynomial approximation meets exact computation

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)