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
The K$K$‐prize‐collecting coverage problem by aligned disks
The K$K$‐prize‐collecting coverage problem by aligned disks
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Hao Zhang
,
Xiya Zheng
,
Zhonghao Liu
,
Xiaofei Liu
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
Internet
https://onlinelibrary.wiley.com/doi/10.1111/itor.13608
Similar Items
Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
by: Gang Liu, et al.
Published: (2024)
Contractors allocation for public building maintenance: a sustainable approach aligned with SDGs using AHP‐TOPSIS and bi‐objective optimization
by: Malek Masmoudi, et al.
Published: (2025)
Second‐order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
by: Marcella Braga de Assis Linhares, et al.
Published: (2024)
The tree‐of‐hubs location problem with interhub stopovers
by: Oscar H. Ariztegui‐Beltrán, et al.
Published: (2025)
The team orienteering problem with variable time windows
by: Bibiana Granda, et al.
Published: (2024)