Copertina

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Moon, Kyungduk, Lee, Kangbok, Paulevé, Loïc
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Discrete Mathematics Dynamical Systems Molecular Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computational Complexity of Minimal Trap Spaces in Boolean Networks
di: Moon, Kyungduk, et al.
Pubblicazione: (2022)

Canalization as a stabilizing principle of gene regulatory networks: a discrete dynamical systems perspective
di: Kadelka, Claus
Pubblicazione: (2025)

Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs
di: Harfouche, Rayan, et al.
Pubblicazione: (2024)

The Mixed Integer Trust Region Problem
di: Del Pia, Alberto
Pubblicazione: (2024)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
di: Alidaee, Bahram, et al.
Pubblicazione: (2024)

An SDP Relaxation for the Sparse Integer Least Squares Problem
di: Del Pia, Alberto, et al.
Pubblicazione: (2022)

Stability of Linear Boolean Networks
di: Chandrasekhar, Karthik, et al.
Pubblicazione: (2022)

Attractor identification in asynchronous Boolean dynamics with network reduction
di: Tonello, Elisa, et al.
Pubblicazione: (2023)

Economic Dispatch of a Single Micro-Gas Turbine Under CHP Operation with Uncertain Demands
di: Sharf, Miel, et al.
Pubblicazione: (2021)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
di: Vercesi, Eleonora, et al.
Pubblicazione: (2025)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
di: Lee, Jae Hyeok, et al.
Pubblicazione: (2026)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
di: Proença, Nathan Benedetto, et al.
Pubblicazione: (2026)

mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks
di: Trinh, Van-Giang, et al.
Pubblicazione: (2024)

A Tight Formulation for the Dial-a-Ride Problem
di: Gaul, Daniela, et al.
Pubblicazione: (2023)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
di: Schade, Jamico, et al.
Pubblicazione: (2023)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
di: Li, Zongji, et al.
Pubblicazione: (2023)

Minimum Cut Representability of Stable Matching Problems
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

Minimum 0-Extension Problems on Directed Metrics
di: Hirai, Hiroshi, et al.
Pubblicazione: (2020)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
di: Nishida, Yuki
Pubblicazione: (2025)

Linear Programming Hierarchies Collapse under Symmetry
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
di: Wang, Haibo, et al.
Pubblicazione: (2024)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
di: Hu, Hins, et al.
Pubblicazione: (2025)

Branch and Price for the Length-Constrained Cycle Partition Problem
di: Ghannam, Mohammed, et al.
Pubblicazione: (2024)

Recursive Self-Composite Approach Towards Structural Understanding of Boolean Network
di: Kim, Jongrae, et al.
Pubblicazione: (2023)

Saturation-Based Atom Provenance Tracing in Chemical Reaction Networks
di: Friedrichs, Marcel, et al.
Pubblicazione: (2025)

Computation of Immediate Neighbours of Monotone Boolean Functions
di: Cury, José E. R., et al.
Pubblicazione: (2024)

Pathway Realisability in Chemical Networks
di: Andersen, Jakob L., et al.
Pubblicazione: (2023)

Refining Boolean models with the partial most permissive scheme
di: Boina, Nadine Ben, et al.
Pubblicazione: (2024)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
di: Bernardelli, Ambrogio Maria, et al.
Pubblicazione: (2024)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
di: Lozano, Leonardo, et al.
Pubblicazione: (2022)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
di: Tellache, Nour ElHouda, et al.
Pubblicazione: (2025)

Cluster Assignment in Multi-Agent Systems
di: Sharf, Miel, et al.
Pubblicazione: (2022)

Phenotype control and elimination of variables in Boolean networks
di: Tonello, Elisa, et al.
Pubblicazione: (2024)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
di: Villa, Tullio, et al.
Pubblicazione: (2025)

Optimal and $H_\infty$ Control of Stochastic Reaction Networks
di: Briat, Corentin, et al.
Pubblicazione: (2021)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
di: Grüne, Christoph, et al.
Pubblicazione: (2023)

Structural Stability Properties of Antithetic Integral (Rein) Control with Output Inhibition
di: Briat, Corentin, et al.
Pubblicazione: (2022)

Learning to Remove Cuts in Integer Linear Programming
di: Puigdemont, Pol, et al.
Pubblicazione: (2024)

On the Multi-Commodity Flow with convex objective function: Column-Generation approaches
di: Beraud-Sudreau, Guillaume, et al.
Pubblicazione: (2026)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
di: Bussemaker, Jasper H., et al.
Pubblicazione: (2025)