A variational inequality heuristic algorithm for a constrained multi-source location-allocation model
alternative location-allocationfacility locationnearest center reclassificationvariational inequality
Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Approximation methods and heuristics in mathematical programming (90C59)
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- A heuristic algorithm for constrain single-source problem with constrained customers
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
This page was built for publication: A variational inequality heuristic algorithm for a constrained multi-source location-allocation model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2924681)