Pages that link to "Item:Q2847898"
From MaRDI portal
The following pages link to Network and Discrete Location: Models, Algorithms, and Applications, Second Edition (Q2847898):
Displayed 28 items.
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- An integrated supply chain problem: a nested Lagrangian relaxation approach (Q492808) (← links)
- Location and capacity design of congested intermediate facilities in networks (Q747013) (← links)
- Territorial design optimization for business sales plan (Q1636794) (← links)
- A survey of healthcare facility location (Q1652170) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- Axiomatic characterization of the center function. The case of non-universal axioms (Q1752587) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
- A two-stage robust model for a reliable \(p\)-center facility location problem (Q1988633) (← links)
- An exact solution framework for the multiple gradual cover location problem (Q2003421) (← links)
- Market proliferation and the impact of locational complexity on network restructuring (Q2109792) (← links)
- The complete vertex \(p\)-center problem (Q2219518) (← links)
- Capacitated refueling station location problem with traffic deviations over multiple time periods (Q2358103) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- Location-based techniques for the synergy approximation in combinatorial transportation auctions (Q2629915) (← links)
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (Q2664416) (← links)
- Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs (Q2668783) (← links)
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
- (Q4556289) (← links)
- A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS (Q5009369) (← links)
- Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
- (Q5146303) (← links)
- The Effect of Environmental Criteria on Locating a Biorefinery: A Green Facility Location Problem (Q5162165) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- Robust facility location in reverse logistics (Q6115584) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)