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
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem
Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Bruno Burin
,
Hamidreza Validi
,
Bochuan Lyu
,
Illya V. Hicks
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
Networks
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.1002/net.70020
Similar Items
Optimal Mixed Integer Linear Optimization Trained Multivariate Classification Trees
by: Alston, Brandon, et al.
Published: (2024)
Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing
by: Harkness, Adrian, et al.
Published: (2025)
Efficient Mixed Integer Linear Programming Approaches to Dynamic Path Restoration
by: Rubtsov, Alexander, et al.
Published: (2024)
Mixed‐Integer Linear Programming Approaches for Nested p$$ p $$‐Center Problems With Absolute and Relative Regret Objectives
by: Christof Brandstetter, et al.
Published: (2025)
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem
by: Yingli Ran, et al.
Published: (2024)