Mourad Baïou

Viet Hung Nguyen

J. Comb. Optim., March, 2024

Generalized nash fairness solutions for bi-objective minimization problems.

[BibT_eX]

[DOI]

Networks, January, 2024

Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski.

[BibT_eX]

[DOI]

José Correa

Rida Laraki

Math. Program., January, 2024

Proportional Fairness for Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Complexity, algorithmic, and computational aspects of a dial-a-ride type problem.

[BibT_eX]

[DOI]

Rafael Colares

Hervé Kerivin

Eur. J. Oper. Res., October, 2023

On some algorithmic aspects of hypergraphic matroids.

[BibT_eX]

[DOI]

Discret. Math., 2023

Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023

Multiple Heuristics with Reinforcement Learning to Solve the Safe Shortest Path Problem in a Warehouse.

[BibT_eX]

[DOI]

Aurélien Mombelli

Alain Quilliot

Proceedings of the Operations Research and Enterprise Systems, 2023

A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem.

[BibT_eX]

[DOI]

Aurélien Mombelli

Alain Quilliot

Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023

2022

The complexity of the unit stop number problem and its implications to other related problems.

[BibT_eX]

[DOI]

Rafael Colares

Hervé Kerivin

Theor. Comput. Sci., 2022

Network disconnection games: A game theoretic approach to checkpoint evaluation in networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Horizontal collaboration in forestry: game theory models and algorithms for trading demands.

[BibT_eX]

[DOI]

Gianpaolo Oriolo

Gautier Stauffer

CoRR, 2022

A comparative study of linearization methods for Ordered Weighted Average.

[BibT_eX]

[DOI]

Proceedings of the 12th International Workshop on Resilient Networks Design and Modeling, 2022

Packing Hypertrees and the k-cut Problem in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

Nash Balanced Assignment Problem.

[BibT_eX]

[DOI]

Minh Hieu Nguyen

José Luis Figueroa González

Viet Hung Nguyen

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Nash fairness solutions for balanced TSP.

[BibT_eX]

[DOI]

Proceedings of the 10th International Network Optimization Conference, 2022

Searching for a Safe Shortest Path in a Warehouse.

[BibT_eX]

[DOI]

Aurélien Mombelli

Alain Quilliot

Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

Safe Management of Autonomous Vehicles.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Control, 2022

2021

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2021

Algorithms for the Safe Management of Autonomous Vehicles.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

2020

Network strength games: the core and the nucleolus.

[BibT_eX]

[DOI]

Math. Program., 2020

On the p-Median Polytope and the Directed Odd Cycle Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

On the star forest polytope for trees and cycles.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2019

MIND: An approach to optimize communication time via middleware tuning.

[BibT_eX]

[DOI]

Abdeslem Belghoul

Farouk Toumani

Inf. Syst., 2019

An Algorithm to Compute the Nucleolus of Shortest Path Games.

[BibT_eX]

[DOI]

Algorithmica, 2019

Faster Algorithms for Security Games on Matroids.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

On the p-median polytope and the odd directed cycle inequalities: Oriented graphs.

[BibT_eX]

[DOI]

Networks, 2018

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.

[BibT_eX]

[DOI]

Math. Program., 2018

The Stop Number Minimization Problem: Complexity and Polyhedral Analysis.

[BibT_eX]

[DOI]

Rafael Colares

Hervé Kerivin

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

Bounds on Directed star arboricity in some digraph classes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On the Nucleolus of Shortest Path Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Preface.

[BibT_eX]

[DOI]

Michel Habib

Lhouari Nourine

RAIRO Oper. Res., 2016

On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2016

A note on many-to-many matchings and stable allocations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Stackelberg Bipartite Vertex Cover and the Preflow Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2016

2014

A polyhedral study of a two level facility location model.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2014

On a connection between facility location and perfect graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

The Dominating Set Polytope via Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

On a class of intersection graphs.

[BibT_eX]

[DOI]

CoRR, 2013

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2011

On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms.

[BibT_eX]

[DOI]

José Correa

SIAM J. Discret. Math., 2011

On the linear relaxation of the p-median problem.

[BibT_eX]

[DOI]

Discret. Optim., 2011

2010

On the p-median polytope of fork-free graphs.

[BibT_eX]

[DOI]

José Correa

Electron. Notes Discret. Math., 2010

2009

On the Integrality of Some Facility Location Polytopes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

2008

A linear programming approach to increasing the weight of all minimum spanning trees.

[BibT_eX]

[DOI]

Networks, 2008

On the p-median polytope of Y-free graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2008

On the Location and <i>p</i>-Median Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Characterizations of the optimal stable allocation mechanism.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

2005

The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation.

[BibT_eX]

[DOI]

José R. Correa

Electron. Notes Discret. Math., 2005

2004

Student admissions and faculty recruitment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Admissions and Recruitment.

[BibT_eX]

[DOI]

Am. Math. Mon., 2003

2002

The Steiner Traveling Salesman Polytope and Related Polyhedra.

[BibT_eX]

[DOI]

Ali Ridha Mahjoub

SIAM J. Optim., 2002

Erratum: The Stable Allocation (or Ordinal Transportation) Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

The Stable Allocation (or Ordinal Transportation) Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

2001

On the dominant of the Steiner 2-edge connected subgraph polytope.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

The stable admissions polytope.

[BibT_eX]

[DOI]

Math. Program., 2000

Separation of Partition Inequalities.

[BibT_eX]

[DOI]

Ali Ridha Mahjoub

Math. Oper. Res., 2000

Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry).

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1997

Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.

[BibT_eX]

[DOI]