A Dynamic Programming Approach to Sequencing Problems

Cited in

(only showing first 100 items - show all)

Kernel bounds for path and cycle problems
Approximation limitations of pure dynamic programming
On Submodular Search and Machine Scheduling
Exact algorithms for intervalizing coloured graphs
Scheduling just-in-time part supply for mixed-model assembly lines
The use of dynamic programming in genetic algorithms for permutation problems
Approximation of the double traveling salesman problem with multiple stacks
Special frequency quadrilaterals and an application
Long directed detours: reduction to 2-disjoint paths
Winning the race to customers with micro-fulfillment centers: an approach for network planning in quick commerce
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
From symmetry to asymmetry: generalizing TSP approximations by parametrization
Exponential approximation schemata for some network design problems
Single machine scheduling with flow time and earliness penalties
Further results on the probabilistic traveling salesman problem
scientific article; zbMATH DE number 7559154 (Why is no real title available?)
Exact algorithms for inventory constrained scheduling on a single machine
Minimum sum vertex cover: difficulty of ordering
On the refinement of bounds of heuristic algorithms for the traveling salesman problem
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Sharp separation and applications to exact and parameterized algorithms
Integer programming approaches to the travelling salesman problem
\(\mathrm P \overset {?} {=} \mathrm{NP}\)
On one routing problem modeling movement in radiation fields
On one routing task with the optimization of the start-finish point
A dynamic programming formulation for the one machine sequencing problem
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals
IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
On the analysis of optimization problems in arc-dependent networks
Evaluation of permanents in rings and semirings
Multi-product lot-sizing and sequencing on a single imperfect machine
Finding and enumerating Hamilton cycles in 4-regular graphs
Elements of dynamic programming in extremal routing problems
Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards
Optimizing automated sorting in warehouses: the minimum order spread sequencing problem
Bounding the running time of algorithms for scheduling and packing problems
Sequencing jobs on a single machine: A neural network approach
Scheduling with time-dependent discrepancy times
Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
A note on exact algorithms for vertex ordering problems on graphs
Minimum sum vertex cover: kernelization and parameterized algorithms
A unified pre-training and adaptation framework for combinatorial optimization on graphs
Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
Constrained optimal routing
Some constructions for solving routing problems using decompositions and transformations of target sets
Using cutting planes to solve the symmetric Travelling Salesman problem
Domino sequencing: scheduling with state-based sequence-dependent setup times
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
The maximum number of connected sets in regular graphs
Open problems around exact algorithms
Fast monotone summation over disjoint sets
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
Finding supported paths in heterogeneous networks
Solving the max-cut problem using eigenvalues
Sequencing of picking orders in mobile rack warehouses
On sequential traversal of sets
DNA origami and the complexity of Eulerian circuits with turning costs
The routing bottlenecks problem (optimization within zones)
On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
New exact algorithms for the 2-constraint satisfaction problem
A cutting plane procedure for the travelling salesman problem on road networks
scientific article; zbMATH DE number 7204408 (Why is no real title available?)
Traveling salesman problem with backend information processing
Learning to guide local search optimisation for routing problems
Finding paths of length \(k\) in \(O^{*}(2^k)\) time
Treewidth computation and extremal combinatorics
Four solution techniques for a general one machine scheduling problem. A comparative study
The traveling-salesman problem and minimum spanning trees: Part II
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Fast exact algorithms for survivable network design with uniform requirements
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
Vector TSP: a traveling salesperson problem with racetrack-like acceleration constraints
On the fastest finite Markov processes
Method of scaling in approximate solution of the traveling salesman problem
Minimizing the sum of weighted completion times with unrestricted weights
Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
Minimizing total tardiness in a scheduling problem with a learning effect
A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
Submodularity and the traveling salesman problem
Logistics planning of cash transfer to Syrian refugees in Turkey
Few Hamiltonian cycles in graphs with one or two vertex degrees
To the question of optimization of the starting point in the routing problem with restrictions
Finding a Hamilton cycle fast on average using rotations and extensions
Tabu search performance on the symmetric travelling salesman problem
Polynomial time algorithms for some minimum latency problems
Robust combinatorial optimization with variable cost uncertainty
Completing partial schedules for open shop with unit processing times and routing
An active global attack model for sensor source location privacy: analysis and countermeasures
A diagonal completion and 2-optimal procedure for the travelling salesman problem
A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
Single machine scheduling under market uncertainty
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Minimizing flowtime and missed due-dates in single-machine sequencing
Estimation of the covariance matrix of a Gaussian Markov random field under a total positivity constraint
The Euclidean traveling salesman problem is NP-complete
Hybrid algorithm for sequencing with bicriteria
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers
Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations.

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)