Pages that link to "Item:Q1751901"
From MaRDI portal
The following pages link to Hybrid optimization methods for time-dependent sequencing problems (Q1751901):
Displaying 19 items.
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
- Decision diagrams for solving traveling salesman problems with pickup and delivery in real time (Q2294298) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm (Q2656500) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← 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)
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Sequencing mixed-model assembly lines with demand management: problem development and efficient multi-objective algorithms (Q6047979) (← links)