Exploració per tema "Integer linear programming"
Ara es mostren els items 1-12 de 12
-
A mathematical formulation of the loop pipelining problem
(Universitat Politècnica de Catalunya (UPC), 1996)
Text en actes de congrés
Accés obertThis paper presents a mathematical model for the loop pipelining problem that considers several parameters for optimization and supports any combination of resource and timing constraints. The unrolling degree of the loop ... -
A novel model for arc territory design: promoting Eulerian districts
(2015-01-01)
Article
Accés obertThe problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be ... -
Aligning textual and graphical descriptions of processes through ILP techniques
(Springer, 2017)
Comunicació de congrés
Accés obertWith the aim of having individuals from different backgrounds and expertise levels examine the operations in an organization, different representations of business processes are maintained. To have these different ... -
Alignment of biological networks by integer linear programming: virus-host protein-protein interaction networks
(2020-11-18)
Article
Accés obertBackground: The alignment of protein-protein interaction networks was recently formulated as an integer quadratic programming problem, along with a linearization that can be solved by integer linear programming software ... -
Cost-efficient virtual optical network embedding for manageable inter-data-center connectivity
(2013-02)
Article
Accés obertNetwork virtualization opens the door to novel infrastructure services offering connectivity and node manageability. In this letter, we focus on the cost-efficient embedding of on-demand virtual optical network requests ... -
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem
(2018-01-01)
Article
Accés obertFinding the longest common subsequence of a given set of input strings is a relevant problem arising in various practical settings. One of these problems is the so-called longest arc-preserving common subsequence problem. ... -
IntSat: integer linear programming by conflict-driven constraint learning
(Taylor & Francis Group, 2023-09-27)
Article
Accés restringit per política de l'editorialState-of-the-art SAT solvers are nowadays able to handle huge real-world instances. The key to this success is the Conflict-Driven Clause-Learning (CDCL) scheme, which encompasses a number of techniques that exploit the ... -
Large neighborhood search for the most strings with few bad columns problem
(Springer, 2016-10-06)
Article
Accés obertIn this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings ... -
Network planning for the future railway communications
(Universitat Politècnica de Catalunya, 2022-09-05)
Treball Final de Grau
Accés obertLos Sistemas Inteligentes de Transporte están cambiando la forma en que concebimos el futuro de la movilidad. En particular, los ferrocarriles están experimentando un proceso de transformación para modernizar el transporte ... -
Optimal allocation of virtual optical networks for the future internet
(Institute of Electrical and Electronics Engineers (IEEE), 2012)
Text en actes de congrés
Accés obertOptical network infrastructures can be partitioned into multiple parallel, dedicated virtual networks for a physical infrastructure sharing purpose. However, different transport technologies may impact in both the amount ... -
Survivable IP/MPLS-Over-WSON multilayer network optimization
(Optical Society of America, 2011-08-01)
Article
Accés obertNetwork operators are facing the problem of dimensioning their networks for the expected huge IP traffic volumes while keeping constant or even reducing the connectivity prices. Therefore, new architectural solutions able ... -
The IntSat method for integer linear programming
(Springer, 2014)
Text en actes de congrés
Accés obertConflict-Driven Clause-Learning (CDCL) SAT solvers can automatically solve very large real-world problems. To go beyond, and in particular in order to solve and optimize problems involving linear arithmetic constraints, ...