Pages that link to "Item:Q1609908"
From MaRDI portal
The following pages link to A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908):
Displayed 30 items.
- Entropy based solid transportation problems with discounted unit costs under fuzzy random environment (Q260643) (← links)
- On lower bounds for the fixed charge problem (Q337190) (← links)
- Reduction methods of type-2 uncertain variables and their applications to solid transportation problem (Q508811) (← links)
- A model for two-stage fixed charge transportation problem with multiple objectives and fuzzy linguistic preferences (Q780181) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
- Determining buffer location and size in production lines using tabu search (Q1609894) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem (Q1761123) (← links)
- Uncertain programming models for fixed charge multi-item solid transportation problem (Q1800342) (← links)
- A review of transport market modeling using game-theoretic principles (Q2030641) (← links)
- A fixed charge transportation problem with damageable items under uncertain environment (Q2078659) (← links)
- Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem (Q2095690) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint (Q2317633) (← links)
- Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems (Q2420821) (← links)
- A heuristic algorithm for the fixed charge problem (Q2430567) (← links)
- A bicriteria solid transportation problem with fixed charge under stochastic environment (Q2471264) (← links)
- Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- Team-building with answer set programming in the Gioia-Tauro seaport (Q2909524) (← links)
- Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
- Profit maximization fuzzy 4D-TP with budget constraint for breakable substitute items: a swarm based optimization approach (Q6059836) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems (Q6087082) (← links)