Equity-driven facility location: A two-stage robust optimization approach
AA Digehsara, M Ji, A Ardestani-Jaafari… - Computers & Operations …, 2025 - Elsevier
This paper explores the computational challenge of incorporating equity in p-median facility
location models under uncertain demand and discusses how two-stage robust programming …
location models under uncertain demand and discusses how two-stage robust programming …
Neur2BiLO: Neural Bilevel Optimization
Bilevel optimization deals with nested problems in which a leader takes the first decision to
minimize their objective function while accounting for a follower's best-response reaction …
minimize their objective function while accounting for a follower's best-response reaction …
Learning to Optimize for Mixed-Integer Non-linear Programming
Mixed-integer non-linear programs (MINLPs) arise in various domains, such as energy
systems and transportation, but are notoriously difficult to solve. Recent advances in …
systems and transportation, but are notoriously difficult to solve. Recent advances in …
Optimization over Trained Neural Networks: Taking a Relaxing Walk
Besides training, mathematical optimization is also used in deep learning to model and
solve formulations over trained neural networks for purposes such as verification …
solve formulations over trained neural networks for purposes such as verification …
Network Flow Models for Robust Binary Optimization with Selective Adaptability
Adaptive robust optimization problems have received significant attention in recent years,
but remain notoriously difficult to solve when recourse decisions are discrete in nature. In …
but remain notoriously difficult to solve when recourse decisions are discrete in nature. In …
How Many Policies Do We Need in -Adaptability for Two-stage Robust Integer Optimization?
J Kurtz - arXiv preprint arXiv:2409.12630, 2024 - arxiv.org
In the realm of robust optimization the $ k $-adaptability approach is one promising method
to derive approximate solutions for two-stage robust optimization problems. Instead of …
to derive approximate solutions for two-stage robust optimization problems. Instead of …
[PDF][PDF] Representing Integer Program Value Function with Neural Networks
We study the value function of an integer program (IP), which characterizes how the optimal
objective value changes as the right-hand sides vary. We show that the IP value function can …
objective value changes as the right-hand sides vary. We show that the IP value function can …
Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel Times
P Xiao, Z Zhang, J Chen, J Wang, Z Zhang - The Thirty-eighth Annual … - openreview.net
We consider the robust routing problem with uncertain travel times under the min-max regret
criterion, which represents an extended and robust version of the classic traveling salesman …
criterion, which represents an extended and robust version of the classic traveling salesman …