Publication

Lagrangian relaxation for the integration of discrete choice models in mixed integer linear problems

Related publications (38)

Graph Chatbot

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.

Learning to Remove Cuts in Integer Linear Programming

Volkan Cevher, Grigorios Chrysos, Efstratios Panteleimon Skoulakis

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

2024

We develop a very general version of the hyperbola method which extends the known method by Blomer and Brudern for products of projective spaces to complete smooth split toric varieties. We use it to count Campana points of bounded log-anticanonical height ...

Palaiseau2024

In many transportation systems, a mismatch between the associated design and planning decisions and the demand is typically encountered. A tailored system is not only appealing to operators, which could have a better knowledge of their operational costs, b ...

PERGAMON-ELSEVIER SCIENCE LTD2021

, ,

Designing structures from reused elements is becoming an increasingly important design task for structural engineers as it has potential to significantly reduce adverse environmental impacts of building structures. To allow for a broad application of this ...

2021

This paper considers vessel scheduling with pilotage and tugging constraints in berthing operations with channel restrictions at seaports. To our knowledge, pilotage and tugging requirements have not been simultaneously considered in the literature. This w ...

PERGAMON-ELSEVIER SCIENCE LTD2021

The objective of this thesis is to develop a general methodology to incorporate a disaggregate demand representation in supply-oriented optimization problems that allows to capture the interplay between the behavior of individuals and the decisions to be o ...

EPFL2020

This study proposes a general framework for topology-finding or topology optimization of tensegrity structures. The existing topology-finding formulation of tensegrity structures based on mixed-integer linear programming (MILP) was improved and transformed ...

ASCE-AMER SOC CIVIL ENGINEERS2020

, , , ,

The integration of discrete choice models with Mixed Integer Linear Programming (MILP) models provides a better understanding of customers' preferences to operators while planning for their systems. However, the formulations associated with the former are ...

2018

A Lagrangian relaxation technique for the demand-based benefit maximization problem

Michel Bierlaire, Shadi Sharif Azadeh, Virginie Janine Camille Lurkin, Meritxell Pacheco Paneque, Bernard Gendron

The integration of discrete choice models in Mixed Integer Linear Programming (MILP) models provides a better understanding of the preferences of the customers to the operators while planning for their systems. However, the formulations associated with ch ...

2018

A Lagrangian relaxation technique for the demand-based benefit maximization problem

Michel Bierlaire, Shadi Sharif Azadeh, Virginie Janine Camille Lurkin, Meritxell Pacheco Paneque, Bernard Gendron

Discrete choice models are the state-of-the-art of demand modeling at the disaggregate level. Their integration with Mixed Integer Linear Programming (MILP) models provides a better understanding of customers' preferences to operators while planning for t ...

2018