Heuristic algorithms for minimising total recovery cost of end-of-life products under quality constraints

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...

Omnichannel retail has emerged as the new standard in today's commerce landscape, with retailers integrating their physical and online channels to enhance the customer shopping experience. However, such integration presents significant challenges for retai ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Modern machine learning (ML) models are capable of impressive performances. However, their prowess is not due only to the improvements in their architecture and training algorithms but also to a drastic increase in computational power used to train them.|S ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

In the field of choice modeling, the availability of ever-larger datasets has the potential to significantly expand our understanding of human behavior, but this prospect is limited by the poor scalability of discrete choice models (DCMs): as sample sizes ...

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

The automation of ab initio simulations is essential in view of performing high-throughput (HT) computational screenings oriented to the discovery of novel materials with desired physical properties. In this work, we propose algorithms and implementations ...

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

The calculations performed for the design and operation of a Nuclear Power Plant (NPP) are a key factor for their safety analyses. The standard for the computational analysis of NPPs is the so called conventional approach, which relies on coarse mesh diffu ...

Years of globalization, outsourcing and cost cutting have increased supply chain vulnerability calling for more effective risk mitigation strategies. In our research, we analyze supply chain disruptions in a production setting. Using a bilevel optimization ...

Heuristic algorithms for minimising total recovery cost of end-of-life products under quality constraints

Chat with Graph Search

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

A ride time-oriented scheduling algorithm for dial-a-ride problems

Graph generative deep learning models with an application to circuit topologies

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Quantitative Methods for Omnichannel Decision-Making

Results on Sparse Integer Programming and Geometric Independent Sets

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Approximation Algorithms for Allocation and Network Design

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

A continuum approximation approach to the depot location problem in a crowd-shipping system

Stochastic adaptive resampling for the estimation of discrete choice models

Bayesian reconstruction of memories stored in neural networks from their connectivity

Towards high-throughput many-body perturbation theory: efficient algorithms and automated workflows

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Multi-physics modeling of VVERs with high fidelity high-resolution codes

Modeling and mitigating supply chain disruptions as a bilevel network flow problem