A revised variable neighborhood search for the discrete ordered median problem
From MaRDI portal
Publication:1634286
DOI10.1016/J.EJOR.2018.10.010zbMATH Open1404.90119OpenAlexW2896546063WikidataQ129096972 ScholiaQ129096972MaRDI QIDQ1634286FDOQ1634286
Authors: Paweł Olender, W. Ogryczak 
Publication date: 18 December 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.010
Recommendations
- A modified variable neighborhood search for the discrete ordered median problem
- Variable neighborhood search for the p-median
- The parallel variable neighborhood search for the \(p\)-median problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A parallelized lagrangean relaxation approach for the discrete ordered median problem
- Constraint relaxation for the discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Ordered \(p\)-median problems with neighbourhoods
- The discrete ordered median problem: Models and solution methods.
combinatorial optimizationvariable neighborhood searchdiscrete locationordered weighted averagingdiscrete ordered median problem
Cites Work
- A note on solving large p-median problems
- Genetic algorithms for solving the discrete ordered median problem
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Title not available (Why is that?)
- Location theory. A unified approach
- Title not available (Why is that?)
- Variable neighborhood search
- On solving linear programs with the ordered weighted averaging objective.
- Inequality measures and equitable locations
- Conditional median: a parametric solution concept for location problems
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- An extended covering model for flexible discrete and equity location problems
- A new formulation and resolution method for the \(p\)-center problem
- Variable neighborhood search for the p-median
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- The \(k\)-centrum multi-facility location problem
- A flexible model and efficient solution strategies for discrete location problems
- A modified variable neighborhood search for the discrete ordered median problem
- Exact procedures for solving the discrete ordered median problem
- Title not available (Why is that?)
- Location science
- Title not available (Why is that?)
- Heuristic procedures for solving the discrete ordered median problem
- The discrete ordered median problem: Models and solution methods.
- Ordered median problem with demand distribution weights
Cited In (10)
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem
- Variable neighborhood search for the p-median
- A fresh view on the discrete ordered median problem based on partial monotonicity
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- Ordered median problem with demand distribution weights
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A modified variable neighborhood search for the discrete ordered median problem
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
Uses Software
This page was built for publication: A revised variable neighborhood search for the discrete ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1634286)
