Publications related to A heurisctic 0-1 integer programming method

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

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

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 Improved Linear Programming Approach for Simultaneous Optimization of Water and Energy

François Maréchal, Maziar Kermani, Zoé Périn-Levasseur

An optimization method based on Mixed Integer Linear Programming (MILP) has been developed for simultaneous optimization of water and energy (SOWE) in industrial processes. The superstructure integrates process thermal streams and optimizes the consumption ...

Elsevier2014

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

Completeness and Ambiguity of Schema Cover

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós

Given a schema and a set of concepts, representative of entities in the domain of discourse, schema cover deﬁnes correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly si ...

2013

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

Pascal Fua, François Fleuret, Jérôme Berclaz, Horesh Beny Ben Shitrit

(EN)A method for continuously tracking multiple people partitioned into groups while preserving identities under global appearance constraints, wherein people's trajectories may intersect, and wherein only sparse appearance information is available is disc ...

WO2013

New Results in the Theory of Linear and Integer Programming

Nicolai Hähnle

The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...

EPFL2012

Optimal selection of customers for a last-minute offer

Thomas Rothvoss

We analyze a short-term revenue optimization problem that involves the optimal targeting of customers for a promotion in which a finite number of perishable items are sold on a last-minute offer. The goal is to select the subset of customers to whom the of ...

Informs2010

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

A heurisctic 0-1 integer programming method

Graph Chatbot

Chat with Graph Search

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

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

LP-Based Algorithms for Capacitated Facility Location

An Improved Linear Programming Approach for Simultaneous Optimization of Water and Energy

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

Completeness and Ambiguity of Schema Cover

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

New Results in the Theory of Linear and Integer Programming

Optimal selection of customers for a last-minute offer

Parametric integer programming in fixed dimension

Optimal selection of customers for a last-minute offer

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

Coding Structure and Replication Optimization for Interactive Multiview Video Streaming

LP-Based Algorithms for Capacitated Facility Location

Parametric integer programming in fixed dimension

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

Completeness and Ambiguity of Schema Cover

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

New Results in the Theory of Linear and Integer Programming

An Improved Linear Programming Approach for Simultaneous Optimization of Water and Energy