Aaron M. Ferber

Orcid: 0000-0002-7422-0044

According to our database1, Aaron M. Ferber authored at least 15 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods.
CoRR, 2024

Contrastive Predict-and-Search for Mixed Integer Linear Programs.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

GenCO: Generating Diverse Designs with Combinatorial Constraints.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Learning Lagrangian Multipliers for the Travelling Salesman Problem.
Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023
GenCO: Generating Diverse Solutions to Design Problems with Combinatorial Nature.
CoRR, 2023

Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning.
Proceedings of the International Conference on Machine Learning, 2023

SurCo: Learning Linear SURrogates for COmbinatorial Nonlinear Optimization Problems.
Proceedings of the International Conference on Machine Learning, 2023

Local Branching Relaxation Heuristics for Integer Linear Programs.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Predicting Wildlife Trafficking Routes with Differentiable Shortest Paths.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2021
Learning Pseudo-Backdoors for Mixed Integer Programs.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Controllable Guarantees for Fair Outcomes via Contrastive Information Estimation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems.
Math. Oper. Res., 2020

MIPaaL: Mixed Integer Program as a Layer.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2017
Prize-Collecting TSP with a Budget Constraint.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017


  Loading...