Pages that link to "Item:Q4135210"
From MaRDI portal
The following pages link to Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (Q4135210):
Displaying 50 items.
- 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← links)
- Optimal product design using conjoint analysis: Computational complexity and algorithms (Q1115344) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- Developments in network location with mobile and congested facilities (Q1148202) (← links)
- A comparative study of approaches to dynamic location problems (Q1148205) (← links)
- A cost operator approach to multistage location-allocation (Q1148206) (← links)
- A graph theoretical bound for the p-median problem (Q1148208) (← links)
- Reducibility of minimax to minisum 0-1 programming problems (Q1148229) (← links)
- An upper bound on the number of execution nodes for a distributed join (Q1149802) (← links)
- A tree search algorithm for the p-median problem (Q1162434) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Locational analysis (Q1173002) (← links)
- Fast primal and dual heuristics for the \(p\)-median location problem (Q1176817) (← links)
- The multicovering problem (Q1205691) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Scheduling crackdowns on illicit drug markets (Q1266586) (← links)
- Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada (Q1268426) (← links)
- An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
- Heuristic concentration: Two stage solution construction (Q1278583) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569) (← links)
- Some remarks about the `equivalence' of performance measures in scheduling problems (Q1310028) (← links)
- Analyzing tradeoffs between zonal constraints and accessibility in facility location (Q1317094) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
- An extension of the \(p\)-median group technology algorithm (Q1318507) (← links)
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system (Q1339146) (← links)
- A heuristic for large-size \(p\)-median location problems with application to school location (Q1339149) (← links)
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- A model for the capacitated \(p\)-facility location problem in global environments (Q1374025) (← links)
- A double annealing algorithm for discrete location/allocation problems (Q1390233) (← links)
- The capacitated plant location problem (Q1390274) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Budget constrained location problem with opening and closing of facilities. (Q1413833) (← links)
- 2-medians in trees with pos/neg weights (Q1582068) (← links)
- Hub location at digital equipment corporation: A comprehensive analysis of qualitative and quantitative factors (Q1600841) (← links)
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- A two-phase tabu search approach to the location routing problem (Q1610130) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Lagrangian relaxations for multiple network alignment (Q1741341) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
