Pages that link to "Item:Q1389247"
From MaRDI portal
The following pages link to A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints (Q1389247):
Displaying 18 items.
- Tabu search and lower bounds for a combined production-transportation problem (Q340247) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
- The transportation problem with exclusionary side constraints (Q1022437) (← links)
- Determining buffer location and size in production lines using tabu search (Q1609894) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- Hybrid extreme point tabu search (Q1609924) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
- Solving transportation problems with nonlinear side constraints with tabu search (Q1892666) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Assignment problem with conflicts (Q2273673) (← links)
- Minimum cost noncrossing flow problem on layered networks (Q2414449) (← links)
- Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
- Enhanced Adjacent Extreme-point Search and Tabu Search for the Minimum Concave-cost Uncapacitated Transshipment Problem (Q5285355) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
