Pages that link to "Item:Q1764773"
From MaRDI portal
The following pages link to A branch-and-price approach to \(p\)-median location problems (Q1764773):
Displaying 20 items.
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
- Balancing staffing and switching costs in a service center with flexible servers (Q856284) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- Computational study of large-scale \(p\)-median problems (Q868446) (← links)
- A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Fast primal and dual heuristics for the \(p\)-median location problem (Q1176817) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- A fast swap-based local search procedure for location problems (Q2480210) (← links)
- Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
- Solving large \(p\)-median problems with a radius formulation (Q2899146) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- (Q4229620) (← links)
- (Q4229624) (← links)
- A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
- A column generation approach for the maximal covering location problem (Q5449883) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
