Nathan Adelgren

According to our database, Nathan Adelgren authored at least 6 papers between 2016 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

A unified tool for solving uni-parametric linear programs, convex quadratic programs, and linear complementarity problems.

Nathan Adelgren

Optim. Lett., June, 2026

2025

Reconsidering compact measures: A multiobjective framework for ecological reserve design.

Nathan Adelgren, Lakmali Weerasena, Damitha Bandara

Comput. Oper. Res., 2025

2023

On the utility of production scheduling formulations including record keeping variables.

Nathan Adelgren, Christos T. Maravelias

Comput. Ind. Eng., July, 2023

2022

Branch-and-Bound for Biobjective Mixed-Integer Linear Programming.

Nathan Adelgren, Akshay Gupte

INFORMS J. Comput., 2022

2018

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.

Nathan Adelgren, Pietro Belotti, Akshay Gupte

INFORMS J. Comput., 2018

2016

A two-phase algorithm for the multiparametric linear complementarity problem.

Nathan Adelgren, Margaret M. Wiecek

Eur. J. Oper. Res., 2016