Publications related to Disassembly scheduling

A totally unimodular view of structured sparsity

This paper describes a simple framework for structured sparse recovery based on convex optimization. We show that many interesting structured sparsity models can be naturally represented by linear matrix inequalities on the support of the unknown parameter ...

2015

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. In this work, we identify submodular maximization problems for which one can get a better app ...

Springer Int Publishing Ag2015

A Non-Parametric Approach to Demand Forecasting in Revenue Management

Shadi Sharif Azadeh

In revenue management, the profitability of the inventory and pricing decisions rests on the accuracy of demand forecasts. However, whenever a product is no longer available, true demand may differ from registered bookings, thus inducing a negative bias in ...

2015

A Universal Primal-Dual Convex Optimization Framework

Volkan Cevher, Quoc Tran Dinh, Alp Yurtsever

We propose a new primal-dual algorithmic framework for a prototypical con- strained convex optimization template. The algorithmic instances of our frame- work are universal since they can automatically adapt to the unknown Ho ̈lder con- tinuity properties ...

2015

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

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

Ola Nils Anders Svensson

We study a natural generalization of the problem of minimizing makespan on unrelated machines in which jobs may be split into parts. The different parts of a job can be (simultaneously) processed on different machines, but each part requires a setup time b ...

Springer2014

A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports

Michel Bierlaire, Tomas Robenek, Nitish Umang

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem ...

Elsevier Science Bv2014

FID-guided retrospective motion correction based on autofocusing

Rolf Gruetter, Tobias Kober, Cristina Granziera, Gunnar Krüger

This work investigates the possibility of using FID navigator signals to improve the performance of a recently proposed autofocusing-based retrospective motion correction technique. FID navigators were incorporated into an MP-RAGE sequence and 3 subjects w ...

2014

Light Transport Matrix recovery for nearly planar objects

Martin Vetterli, Paolo Prandoni, Loïc Arnaud Baboulaz, Niranjan Thanikachalam

The light transport matrix has become a powerful tool for scene relighting, owing to the versatility of its representational power of various light transport phenomenon. We argue that scenes with an almost planar surface geometry, even with significant amo ...

SPIE2014

Joint product assortment, inventory and price optimization to attract loyal and non-loyal customers

Ralf Seifert, Jean-Sébastien Tancrez, Argyro Katsifou

In this paper, we analyze the emerging retail practice of carrying a combined product assortment consisting of both regular "standard" products and more fashionable and short-lived "special" products. The purpose of this practice is to increase store traff ...

Pergamon-Elsevier Science Ltd2014

Disassembly scheduling

Graph Chatbot

Chat with Graph Search

A totally unimodular view of structured sparsity

Maximizing Symmetric Submodular Functions

A Non-Parametric Approach to Demand Forecasting in Revenue Management

A Universal Primal-Dual Convex Optimization Framework

Node-weighted network design and maximum sub-determinants

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports

FID-guided retrospective motion correction based on autofocusing

Light Transport Matrix recovery for nearly planar objects

Joint product assortment, inventory and price optimization to attract loyal and non-loyal customers

Light Transport Matrix recovery for nearly planar objects

A Non-Parametric Approach to Demand Forecasting in Revenue Management

Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

Maximizing Symmetric Submodular Functions

Joint product assortment, inventory and price optimization to attract loyal and non-loyal customers

A Universal Primal-Dual Convex Optimization Framework

Node-weighted network design and maximum sub-determinants

FID-guided retrospective motion correction based on autofocusing

A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports

A totally unimodular view of structured sparsity