Publications related to Applications of Strong Convex Relaxations to Allocation Problems

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latte ...

2007

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2007

Average case analysis of multichannel thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

2007

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

Friedrich Eisenbrand, Gennady Shmonin

This mapping problem has to be solved in many application scenarios. In the automotive industry, for example, the implementation of car functions involves distributed task sets running on multiple electronic control units (ECU) with bus-based inter-task co ...

2006

Disassembly scheduling

Hwa-Joong Kim

This dissertation focuses on disassembly scheduling, which is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts/components over a given planning horizon. The objectiv ...

EPFL2005

BDDs in a branch and cut framework

Friedrich Eisenbrand

Branch and cut is today's state-of-the-art method to solve 0/1-integer linear programs. Important for the success of this method is the generation of strong valid inequalities, which tighten the linear programming relaxation of 0/1-IPs and thus allow for e ...

2005

Some combinatorial optimization problems in graphs with applications in telecommunications and tomography

David Schindl

The common point between the different chapters of the present work is graph theory. We investigate some well known graph theory problems, and some which arise from more specific applications. In the first chapter, we deal with the maximum stable set probl ...

EPFL2004

The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP

We say an LP (linear programming) is fully nondegenerate if both the primal and the dual problems are nondegenerate. In this paper, we prove the existence of a sequence of |B∖B| admissible pivot from any basis B (not necessarily feasible) to the unique opt ...

1997

Criss-cross methods: a fresh view on pivot algorithms

Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. Unlike the simplex method that follows ...

Springer-Verlag1997

Tracking elementary particles near their primary vertex: a combinatorial approach

Thomas Liebling

Colliding beams experiments High Energy Physics rely on solid state detectors to track the flight paths of charged elementary particles near their primary point of interaction. Reconstructing tracks in this region requires, per collision, a partitioning of ...

1996

Applications of Strong Convex Relaxations to Allocation Problems

Graph Chatbot

Chat with Graph Search

Average case analysis of multichannel sparse approximations using p- thresholding

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Average case analysis of multichannel thresholding

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

Disassembly scheduling

BDDs in a branch and cut framework

Some combinatorial optimization problems in graphs with applications in telecommunications and tomography

The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP

Criss-cross methods: a fresh view on pivot algorithms

Tracking elementary particles near their primary vertex: a combinatorial approach

Tracking elementary particles near their primary vertex: a combinatorial approach

Average case analysis of multichannel sparse approximations using p- thresholding

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

Disassembly scheduling

BDDs in a branch and cut framework

Some combinatorial optimization problems in graphs with applications in telecommunications and tomography

The existence of a short sequence of admissible pivots to an optimal basis in LP and LCP

Criss-cross methods: a fresh view on pivot algorithms

Average case analysis of multichannel thresholding

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X