Search Results for author:
Found 3 papers, 0 papers with code
Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model
In this paper, we study the assortment optimization problem under the mixed-logit customer choice model.
Competitive Facility Location under Random Utilities and Routing Constraints
To tackle this problem, we explore three types of valid cuts, namely, outer-approximation and submodular cuts to handle the nonlinear objective function, as well as sub-tour elimination cuts to address the complex routing constraints.
A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints
We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
