Pages that link to "Item:Q3292045"
From MaRDI portal
The following pages link to A Dynamic Programming Approach to Sequencing Problems (Q3292045):
Displaying 50 items.
- Single facility multi-class job scheduling (Q917435) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- FMS scheduling based on timed Petri net model and reactive graph search (Q937986) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- An algorithm for finding Hamilton paths and cycles in random graphs (Q1099190) (← links)
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- On the choice of step size in subgradient optimization (Q1149883) (← links)
- A survey of scheduling methods for multiprocessor systems (Q1153687) (← links)
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem (Q1158107) (← links)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108) (← links)
- Hybrid algorithm for sequencing with bicriteria (Q1162274) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- Dynamic programming meets the principle of inclusion and exclusion (Q1165163) (← links)
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
- A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Optimal partitions for shop floor control in semiconductor wafer fabrication (Q1194767) (← links)
- Reduced complexity dynamic programming based on policy iteration (Q1206904) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- A dynamic programming formulation for the one machine sequencing problem (Q1247907) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Job selection and sequencing on a single machine in a random environment (Q1310027) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- A dynamic programming method for single machine scheduling (Q1331548) (← links)
- Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
- The dynamic programming method in the generalized traveling salesman problem (Q1362222) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem (Q1651558) (← links)
- Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
- Finding supported paths in heterogeneous networks (Q1736715) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
