Pages that link to "Item:Q1339126"
From MaRDI portal
The following pages link to A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126):
Displaying 32 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
- Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885) (← links)
- A mixed-integer model for solving ordering problems with side constraints (Q1357786) (← links)
- On due-date based valid cuts for the sequential ordering problem (Q1367938) (← links)
- On dual based lower bounds for the sequential ordering problem with precedences and due dates (Q1417775) (← links)
- Computational analysis of a flexible assembly system design problem (Q1572965) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
- Constrained shortest path tour problem: branch-and-price algorithm (Q2147106) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- A sequential ordering problem in automotive paint shops (Q3159669) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630) (← links)
