Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Sergio Salazar
,
Abraham Duarte
,
J. Manuel Colmenar
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
International Transactions in Operational Research
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm
by: Samuel Nucamendi‐Guillén, et al.
Published: (2024)
Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs
by: Roberto Maria Rosati, et al.
Published: (2026)
The tree‐of‐hubs location problem with interhub stopovers
by: Oscar H. Ariztegui‐Beltrán, et al.
Published: (2025)
The electric vehicle routing problem with time windows, partial recharges, and covering locations
by: Vincent F. Yu, et al.
Published: (2025)
A three‐dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
by: Hongbing Yang, et al.
Published: (2024)