scientific article; zbMATH DE number 1746287
From MaRDI portal
Publication:4532026
Cited in
(only showing first 100 items - show all)- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
- On the geometric median of convex, triangular and other polygonal domains
- scientific article; zbMATH DE number 6006830 (Why is no real title available?)
- A modified variable neighborhood search for the discrete ordered median problem
- Optimal strategies for the one-round discrete Voronoi game on a line
- Special issue: Managerial methods in location
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- An integrated approach for allocation and scheduling-location problems on graphs
- Locating a semi-obnoxious facility with expropriation
- A variational inequality approach for constrained multifacility Weber problem under gauge
- Dispersion with connectivity in wireless mesh networks
- A note on the nestedness property for ordered median problems in tree networks
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
- The p-maxian problem on a tree
- Tree approximation for discrete time stochastic processes: a process distance approach
- Optimal facility location problem on polyhedral terrains using descending paths
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Exact procedures for solving the discrete ordered median problem
- Bridging \(k\)-sum and CVaR optimization in MILP
- Construction Line Algorithms for the Connection Location-Allocation Problem
- OR models in urban service facility location: a critical review of applications and future developments
- scientific article; zbMATH DE number 1159167 (Why is no real title available?)
- Reallocating multiple facilities on the line
- An agent-based framework for modeling and solving location problems
- A fuzzy algorithm for continuous capacitated location allocation model with risk consideration
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- New models for locating a moving service facility
- Facility location problems in the plane based on reverse nearest neighbor queries
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- scientific article; zbMATH DE number 764451 (Why is no real title available?)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
- Eigenvalue localization under partial spectral information
- Multi-facility green Weber problem
- New variants of the simple plant location problem and applications
- r-Gatherings on a star and uncertain r-gatherings on a line
- Gradual cover competitive facility location
- Parametric analysis of optimal facility locations
- The discrete Voronoi game in \(\mathbb{R}^2\)
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
- Variable neighborhood search method for optimizing the emergency service network of police special forces units
- Solving the uncapacitated hub location problem using genetic algorithms
- Complexity of the multi-service center problem
- Inverse group 1-median problem on trees
- The connected \(p\)-median problem on complete multi-layered graphs
- Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post world net
- Complexity of the multi-service center problem
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
- Practical perspectives on symplectic accelerated optimization
- The \(p\)-median problem: a survey of metaheuristic approaches
- Inverse quickest center location problem on a tree
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Allocation search methods for a generalized class of location-allocation problems
- Facility location and supply chain management. A review
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- A triobjective model for locating a public semiobnoxious facility in the plane
- Accelerating the convergence in the single-source and multi-source Weber problems
- \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes
- Fuzzy logic based algorithms for maximum covering location problems
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- A continuous location-allocation problem with zone-dependent fixed cost
- Weighted Voronoi region algorithms for political districting
- A new mixed integer linear programming model for the multi level uncapacitated facility location problem
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Multi-level facility location problems
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
- Conditional facility location problems with continuous demand and a polygonal barrier
- A two-echelon inventory-location problem with service considerations
- Duality for location problems with unbounded unit balls
- New approximation algorithms for the unsplittable capacitated facility location problem
- A survey on approximation mechanism design without money for facility games
- Plant location factors: a field research
- A revised variable neighborhood search for the discrete ordered median problem
- The balanced \(p\)-median problem with unitary demand
- Assigning proximity facilities for gatherings
- The probabilistic \(p\)-center problem: planning service for potential customers
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- Solving the \(k\)-influence region problem with the GPU
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Multiple criteria facility location problems: a survey
- Location of Emergency Facilities with Uncertainty in the Demands
- The ordered capacitated facility location problem
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Approximations for Probability Distributions and Stochastic Optimization Problems
- Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach
- Sequential competitive location on networks
- Heuristics for the dynamic facility location problem with modular capacities
- Weak flow cover inequalities for the capacitated facility location problem
- Preprocessing for a map sectorization problem by means of mathematical programming
- An algorithm for a multicriteria optimization problem and its application to a facility location problem
- ADMM-type methods for generalized multi-facility Weber problem
- An Approach to Location Models Involving Sets as Existing Facilities
- Away from each other
- A mixed-integer approach to Core-Edge design of storage area networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532026)
