Domain-independent dynamic programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6676558 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3982556 (Why is no real title available?)
- scientific article; zbMATH DE number 3731318 (Why is no real title available?)
- scientific article; zbMATH DE number 3782407 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193404 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3570219 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 1759719 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 870411 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A heuristic search approach to planning with temporally extended preferences
- A language and a program for stating and solving combinatorial problems
- A note on two problems in connexion with graphs
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem
- Algebraic dynamic programming
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- An enhanced branch-and-bound algorithm for the talent scheduling problem
- Anytime pack search
- Assembly line balancing: what happened in the last fifteen years?
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- BPPLIB: a library for bin packing and cutting stock problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Branch-and-bound procedure and state—space representation of combinatorial optimization problems
- Breadth-first heuristic search
- Classes of discrete optimization problems and their decision problems
- Combinatorial optimization. Theory and algorithms
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Decision diagram-based branch-and-bound with caching for dominance and suboptimality detection
- Decision diagrams and dynamic programming
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Discrete optimization with decision diagrams
- Discrete-variable extremum problems
- Dynamic Programming as Graph Searching: An Algebraic Approach
- Dynamic programming to minimize the maximum number of open stacks
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Finite State Representations of Discrete Optimization Problems
- Finite-State Processes and Dynamic Programming
- General branch and bound, and its relation to A^* and AO^*
- Heuristic and exact methods for the cutting sequencing problem
- Heuristic search. Theory and applications
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- Improved integer programming models for simple assembly line balancing and related problems
- Improving the filtering of branch-and-bound MDD solver
- In pursuit of the Holy Grail
- Increasing search efficiency using multiple heuristics
- Intruder alert! Optimization models for solving the mobile robot graph-clear problem
- Iterated local search for the team orienteering problem with time windows
- Iterative beam search algorithms for the permutation flowshop
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Learning value heuristics for constraint programming
- Load-dependent and precedence-based models for pickup and delivery problems
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Mathematical models for the minimization of open stacks problem
- Measuring the impact of primal heuristics
- Modelling mixed discrete-continuous domains for planning
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- New Precedence Theorems for One-Machine Weighted Tardiness
- New benchmark instances for the capacitated vehicle routing problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- On the complexity of assembly line balancing problems
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimal scheduling in film production to minimize talent hold cost
- Planning and Scheduling in Manufacturing and Services
- Planning as heuristic search
- Principles and Practice of Constraint Programming – CP 2004
- Representation theorems for equivalent optimization problems
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- STRIPS: A new approach to the application of theorem proving to problem solving
- SeaPearl: a constraint programming solver guided by reinforcement learning
- Solvable classes of discrete dynamic programming
- Solving talent scheduling with dynamic programming
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Studies in Semi-Admissible Heuristics
- Subgoaling techniques for satisficing and optimal numeric planning
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
- The Orienteering Problem with Time Windows
- The fast downward planning system
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The orienteering problem
- The orienteering problem: a survey
- The truck dispatching problem
- Uniform random sampling of planar graphs in linear time
- Vehicle Routing
This page was built for publication: Domain-independent dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232467)
