Publications related to Network Formulations of Mixed-Integer Programs

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

Pascal Frossard, Laura Toni

Interactive multiview video streaming (IMVS) services permit to remotely navigate within a 3D scene with an immersive experience. This is possible by transmitting a set of reference camera views (anchor views), which are used by the clients to freely navig ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Strengths and Limitations of Linear Programming Relaxations

Abbas Bazzi

Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power, this class of algorithms seems to contain the most favourable ...

EPFL2017

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Network Flow Integer Programming to Track Elliptical Cells in Time-Lapse Sequences

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

We propose a novel approach to automatically tracking elliptical cell populations in time-lapse image sequences. Given an initial segmentation, we account for partial occlusions and overlaps by generating an over-complete set of competing detection hypothe ...

2017

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

Michel Bierlaire, Francesco Piu, Prem Kumar

The Locomotive Assignment Problem (LAP) is a class of planning and scheduling problems solved by assigning a fleet of locomotives to a network of trains. In the planning versions of the LAP, the type of consist (a group of linked locomotives) assigned to e ...

Elsevier2015

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Passenger Centric Train Timetabling Problem

Michel Bierlaire, Shadi Sharif Azadeh, Mohammad Yousef Maknoon, Tomas Robenek, Jingmin Chen

The aim of this paper is to analyze and to improve the current planning process of the passenger railway service in light of the recent railway market changes. In order to do so, we introduce the Passenger Centric Train Timetabling Problem. The originality ...

2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jan Kyncl

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

Springer2015

Methodology for Identification of Suitable ORC-Cycle and Working-Fluid using Integration with Multiple Objectives

François Maréchal, Daniel Favrat, Matthias Bendig

In recent times the interest in electricity production with Organic Rankine Cycles (ORC) has increased. A look into recent publications shows that the identification of suitable working fluids is in general done by a look at a more or less small number of ...

Aidic Servizi Srl2014

Network Formulations of Mixed-Integer Programs

Graph Chatbot

Chat with Graph Search

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

Strengths and Limitations of Linear Programming Relaxations

On some algebraic and extremal problems in discrete geometry

Network Flow Integer Programming to Track Elliptical Cells in Time-Lapse Sequences

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Passenger Centric Train Timetabling Problem

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Methodology for Identification of Suitable ORC-Cycle and Working-Fluid using Integration with Multiple Objectives

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Strengths and Limitations of Linear Programming Relaxations

Network Flow Integer Programming to Track Elliptical Cells in Time-Lapse Sequences

On some algebraic and extremal problems in discrete geometry

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

Methodology for Identification of Suitable ORC-Cycle and Working-Fluid using Integration with Multiple Objectives

Passenger Centric Train Timetabling Problem

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex