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.
- On the fastest finite Markov processes (Q2326015) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards (Q2362173) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Further results on the probabilistic traveling salesman problem (Q2368298) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Method of scaling in approximate solution of the traveling salesman problem (Q2392635) (← links)
- An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems (Q2413317) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Incremental versus non-incremental dynamic programming (Q2417149) (← links)
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming (Q2418162) (← links)
- Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals (Q2420806) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- Fast monotone summation over disjoint sets (Q2446070) (← links)
- The deterministic product location problem under a pick-by-order policy (Q2446876) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
- An interactive multiobjective programming approach to combinatorial data analysis (Q2511823) (← links)
- Material allocation in MRP with tardiness penalties (Q2564888) (← links)
- An optimal piecewise-linear program for the U-line balancing problem with stochastic task times (Q2569065) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
- A mathematical model for supply chain management of blood banks in India (Q2656515) (← links)
- Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions (Q2664341) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Tropical complexity, Sidon sets, and dynamic programming (Q2832574) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Edge Elimination in TSP Instances (Q2945197) (← links)
- End-Vertices of Graph Search Algorithms (Q2947028) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- Invitation to Algorithmic Uses of Inclusion–Exclusion (Q3012908) (← links)
- The travelling salesman problem: selected algorithms and heuristics† (Q3033569) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
- Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation (Q3225399) (← links)
