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.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Cyclic inventory routing in a line-shaped network (Q322426) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance (Q351554) (← links)
- Correlated topographic analysis: estimating an ordering of correlated components (Q374131) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Exact algorithms for inventory constrained scheduling on a single machine (Q398845) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- An exact iterative search algorithm for constrained Markov decision processes (Q458792) (← links)
- Elements of dynamic programming in extremal routing problems (Q463354) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Design tools for reporter strands and DNA origami scaffold strands (Q529038) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Constrained optimal routing (Q542269) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- A geometrical method in combinatorial complexity (Q3902478) (← links)
- Solving a Routing Problem with the Aid of an Independent Computations Scheme (Q4692135) (← 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)
- ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION (Q4986290) (← links)
- On sequential traversal of sets (Q5037478) (← links)
- (Q5089192) (← links)
- (Q5090495) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- (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)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation (Q5140740) (← links)
