scientific article; zbMATH DE number 821272

From MaRDI portal
Revision as of 03:46, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4857376

zbMath0870.90076MaRDI QIDQ4857376

Mark S. Daskin

Publication date: 28 November 1995


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

A study on the budget constrained facility location model considering inventory management costA survey of variants and extensions of the location-routing problemThe continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memoryA decomposition approach to solve a bilevel capacitated facility location problem with equity constraintsAn efficient algorithm for solving the median problem on real road networksLocation of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcsLocation of Emergency Facilities with Uncertainty in the DemandsHeuristic algorithms for siting alternative-fuel stations using the flow-refueling location modelThe multi-period \(p\)-center problem with time-dependent travel timesUnnamed ItemGRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problemApproximability results for the $p$-centdian and the converse centdian problemsA faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holesFlowLoc problems with maximum excess flowCovering edges in networksLocation Science in CanadaThe two-echelon stochastic multi-period capacitated location-routing problemA trajectory based heuristic for the planar \(p\)-median problemThe multilevel facility location and pricing problems: the computational complexity and the stability analysisCompetitive Multilevel Capacity AllocationExtensions to the planar \(p\)-median problemA modified optimal algorithm for 2-maxian location problems on cactus graphsUnnamed ItemSiting and sizing of facilities under probabilistic demandsSiting and sizing of facilities under probabilistic demandsOptimal Control Strategies for Incoming InspectionOptimality conditions for distributive justiceAn Improved Competitive Algorithm for One-Dimensional Incremental Median ProblemA practical heuristic for maximum coverage in large-scale continuous location problemThe school bus routing and scheduling problem with transfersLexicographicα-robustness: an application to the 1-median problemStatic competitive facility location: an overview of optimisation approaches.A particle swarm optimization algorithm with path relinking for the location routing problemOn solving complex multi-period location models using simulated annealing.Solving the uncapacitated facility location problem using tabu searchAn exact algorithm for the capacitated vertex \(p\)-center problemExact procedures for solving the discrete ordered median problemNetwork design for reverse and closed‐loop supply chains: An annotated bibliography of models and solution approachesA defensive maximal covering problem on a networkSolving thep-Center problem with Tabu Search and Variable Neighborhood SearchFinding a cluster of points and the grey pattern quadratic assignment problemExact algorithms for integrated facility location and production planning problemsLinear Time Optimal Approaches for Max-Profit Inverse 1-Median Location ProblemsOptimal facility location with random throughput costsOn the circle closest to a set of pointsFast heuristics for large scale covering-location problemsOn the use of genetic algorithms to solve location problemsA column generation approach for the maximal covering location problemFuzzy partition models for fitting a set of partitionsOn the shortest path problem with negative cost cyclesTowards optimizing the deployment of optical access networksA multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoffAlternative fuel station location model with demand learningEffectiveness-equity models for facility location problems on tree networksPharmacy duty scheduling problemMathematical Models and Search Algorithms for the Capacitated p-Center ProblemAllocating servers to facilities, when demand is elastic to travel and waiting timesCombinatorial algorithms for inverse absolute and vertex 1-center location problems on treesP-Median Problems with an Additional Constraint on the Assignment VariablesA facility reliability problem: Formulation, properties, and algorithmOptimal algorithms for selective variants of the classical and inverse median location problems on treesA two-echelon inventory-location problem with service considerationsA Branch-and-Price Algorithm for Facility Location with General Facility Cost FunctionsModels and algorithms for the screen line-based traffic-counting location problemsThe \(p\)-facility ordered median problem on networksThe single-node dynamic service scheduling and dispatching problemAn ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São PauloSolving the absolute 1-center problem in the quickest path caseSelecting hierarchical facilities in a service-operations environmentMaximal covering code multiplexing access telecommunication networksA maximal covering location model in the presence of partial coverageImplementing a mathematical model for locating EMS vehicles in Fayetteville, NCEffective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problemThe planar multifacility collection depots location problemCost-optimal topology planning of hierarchical access networksA scalable exact algorithm for the vertex \(p\)-center problemDistribution network design for fixed lifetime perishable products: a model and solution approachThe effect of optimizing warehouse locations on omnichannel designsThe minimum equitable radius location problem with continuous demandAn extended covering model for flexible discrete and equity location problemsSolution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative exampleA bibliography for some fundamental problem categories in discrete location scienceRegional service coverage modelingThe minimum weighted covering location problem with distance constraintsDynamic supply chain design with inventorySiting park-and-ride facilities using a multi-objective spatial optimization modelModeling data envelopment analysis (DEA) efficient location/allocation decisionsOptimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approachSustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approachBase station location and channel allocation in a cellular network with emergency coverage requirementsTwo new algorithms for UMTS access network topology designOnline scheduling problems with flexible release dates: applications to infrastructure restorationThe Weber obnoxious facility location model: a big arc small arc approachEmergency medical services and beyond: addressing new challenges through a wide literature reviewVoronoi diagrams with overlapping regionsA Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain designLocation and layout planning. A surveySome heuristic methods for solving \(p\)-median problems with a coverage constraintOptimizing the supply chain configuration for make-to-order manufacturingInteger linear programming models for grid-based light post location problem


Uses Software



This page was built for publication: