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
Ensuring connectedness for the maximum quasi‐clique and densest k ‐subgraph problems
Ensuring connectedness for the maximum quasi‐clique and densest k ‐subgraph problems
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Daniela Scherer dos Santos
,
Kathrin Klamroth
,
Pedro Martins
,
Luís Paquete
Format:
Artículo Open Access
Published:
Wiley
2026
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.70184
Similar Items
Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
Ensuring eco‐resilience in Physical Internet‐enabled production routing problem under ripple effect: a scenario‐based robust possibilistic flexible programming approach
by: Peng‐yun Zhao, et al.
Published: (2025)
A computational evaluation of new and existing dispatching rules for the single machine total weighted tardiness problem
by: Ana Sofia M. Martins, et al.
Published: (2025)
Enhancing logistics through a vehicle routing problem with deliveries, pickups, and backhauls
by: Maria João Santos, et al.
Published: (2024)
Hierarchical goal programming approaches to solve a discrete‐time formulation for the aircraft recovery problem of a Brazilian oil and gas company
by: Tarley Mansur Fantazzini, et al.
Published: (2024)