Publications related to Modeling the satellite placement problem as a network flow problem with one side constraint

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Nikolaos Geroliminis, Jack Haddad, Mohammadreza Hajiahmadi

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...

Institute of Electrical and Electronics Engineers2015

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

Bernard Moret, Yu Lin, Mingfu Shao

Computing the edit distance between two genomes is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under t ...

Mary Ann Liebert2015

Multi-objective optimization of SNG production from microalgae through hydrothermal gasification

François Maréchal, Adriano Viana Ensinas, Alberto Mian

The conversion of microalgae biomass into biofuels is a quite well explored field of research. Due to high photosynthetic efficiency, microalgae are considered as a potential feedstock for next-generations biofuel conversion processes. This paper addresses ...

2015

Detecting and Tracking Cells using Network Flow Programming

Pascal Fua, Engin Türetken, Xinchao Wang, Carlos Joaquin Becker

We propose a novel approach to automatically detecting and tracking cell populations in time-lapse images. Unlike earlier ones that rely on linking a predetermined and potentially under-complete set of detections, we generate an overcomplete set of competi ...

2015

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

Pascal Frossard

Multiview video refers to videos of the same dynamic 3-D scene captured simultaneously by multiple closely spaced cameras from different viewpoints. We study interactive streaming of pre-encoded multiview videos, where, at any time, a client can request an ...

Ieee-Inst Electrical Electronics Engineers Inc2014

LP-Based Algorithms for Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodo ...

IEEE2014

An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes

Bernard Moret, Yu Lin, Mingfu Shao

Computing the edit distance between two genomes is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under t ...

Springer Verlag2014

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

Tracking Interacting Objects Optimally Using Integer Programming

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

In this paper, we show that tracking different kinds of interacting objects can be formulated as a network-flow Mixed Integer Program. This is made possible by tracking all objects simultaneously and expressing the fact that one object can appear or disapp ...

Springer Int Publishing Ag2014

Single machine scheduling with scenarios

Ola Nils Anders Svensson

In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design algorithms that are applicable in the presence of uncertainty in ...

2013

Modeling the satellite placement problem as a network flow problem with one side constraint

Graph Chatbot

Chat with Graph Search

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

Multi-objective optimization of SNG production from microalgae through hydrothermal gasification

Detecting and Tracking Cells using Network Flow Programming

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

LP-Based Algorithms for Capacitated Facility Location

An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes

Node-weighted network design and maximum sub-determinants

Tracking Interacting Objects Optimally Using Integer Programming

Single machine scheduling with scenarios

An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes

Detecting and Tracking Cells using Network Flow Programming

Multi-objective optimization of SNG production from microalgae through hydrothermal gasification

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

LP-Based Algorithms for Capacitated Facility Location

Tracking Interacting Objects Optimally Using Integer Programming

Single machine scheduling with scenarios

Node-weighted network design and maximum sub-determinants