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.
- (Q3303464) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- Production scheduling of independent jobs on parallel identical processors (Q3346074) (← links)
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem (Q3430248) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- An Active Global Attack Model for Sensor Source Location Privacy: Analysis and Countermeasures (Q3556630) (← links)
- Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) (← links)
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
- Sequential algorithm for the solution of problems of combinatorial optimization on permutations (Q3755239) (← links)
- A geometrical method in combinatorial complexity (Q3902478) (← links)
- Integer programming approaches to the travelling salesman problem (Q4105495) (← links)
- A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)
- Some optimal path problems subject to improvements (Q4157613) (← links)
- Using cutting planes to solve the symmetric Travelling Salesman problem (Q4175048) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- Solving a Routing Problem with the Aid of an Independent Computations Scheme (Q4692135) (← links)
- Validation of subgradient optimization (Q4770776) (← links)
- On one routing problem modeling movement in radiation fields (Q4961696) (← links)
- Оptimization of the Start Point in the Gtsp with the Precedence Conditions (Q4963242) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION (Q4986290) (← links)
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals (Q5024637) (← links)
- On sequential traversal of sets (Q5037478) (← links)
- Sparktope: linear programs from algorithms (Q5043848) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- One task of routing jobs in high radiation conditions (Q5067414) (← links)
- (Q5089192) (← links)
- (Q5090495) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Computing the maximum using \((\min,+)\) formulas (Q5111291) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- Optimizing multi-inserts in routing problems with constraints (Q5114290) (← links)
- On the question of the optimization of permutations in the problem with dynamic constraints (Q5114333) (← links)
- Finding a Hamilton cycle fast on average using rotations and extensions (Q5120740) (← links)
- OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
- On one routing task with the optimization of the start-finish point (Q5134238) (← links)
- The routing problems with optimization of the starting point: dynamic programming (Q5134261) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation (Q5140740) (← links)
- To the question of optimization of the starting point in the routing problem with restrictions (Q5151947) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- Some constrained shortest-route problems (Q5636707) (← links)
- The traveling-salesman problem and minimum spanning trees: Part II (Q5641007) (← links)
- (Q5661328) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- (Q5743515) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
