World's Best Scientists 2026 revealed!
Michel Minoux

Michel Minoux

D-Index & Metrics

Computer Science

D-Index
34
Citations
5074
World Ranking
12163
National Ranking
306

Overview

Michel Minoux is affiliated with Sorbonne University in France, focusing research primarily in engineering and computer science domains. Their work spans several subfields including electrical and electronic engineering, computational theory and mathematics, industrial and manufacturing engineering, as well as management science and operations research.

The research topics covered by Michel Minoux encompass a variety of specialized areas:

  • Smart Grid Energy Management
  • Complexity and Algorithms in Graphs
  • Vehicle Routing Optimization Methods
  • Advanced Graph Theory Research
  • Electric Power System Optimization
  • Risk and Portfolio Optimization
  • Electric Vehicles and Infrastructure

Michel Minoux has contributed papers to several academic venues, including:

  • Optimization Letters
  • Journal of Global Optimization
  • IET conference proceedings.

Among recent publications authored or co-authored by Michel Minoux are:

  • Voltage regulation in a LV distribution network with renewables and electric vehicles - an optimization formulation (2023), IET conference proceedings.
  • Optimal deterministic and robust selection of electricity contracts (2021), Journal of Global Optimization.
  • Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results (2020), Optimization Letters.

Frequent co-authors collaborating with Michel Minoux include:

  • Viết Hùng Nguyễn
  • David Wu
  • Hai Van Tran
  • D. Croteau
  • A. Laugere

The body of work reflects a consistent engagement with optimization problems related to electric power systems, graph theory, and smart grid technologies. The blend of theoretical and applied research spans from algorithmic complexity issues to practical considerations in energy distribution and contract management.

Best Publications

  • Networks synthesis and optimum network design problems: Models, solution methods and applications

    Michel Minoux

  • Accelerated greedy algorithms for maximizing submodular set functions

    Unknown

  • Graphes et algorithmes

    Michel Gondran;Michel Minoux

  • Graphs, dioids and semirings : new models and algorithms

    Michel Gondran;Michel Minoux

  • A new approach for crew pairing problems by column generation with an application to air transportation

    Sylvie Lavoie;Michel Minoux;Edouard Odier

  • LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation

    Unknown

  • Exact solution of multicommodity network optimization problems with general step cost functions

    Unknown

  • Linear Algebra in Dioids: A Survey of Recent Results

    Unknown

  • Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)

    Michel Gondran;Michel Minoux

  • Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation

    Georgios K.D. Saharidis;Michel Minoux;Yves Dallery

  • An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment

    Celso Carneiro Ribeiro;Michel Minoux;Manoel Camillo Penna

  • Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

    Michel Minoux

  • A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets

    Kamel Barkaoui;Michel Minoux

  • Robust network optimization under polyhedral demand uncertainty is NP-hard

    Unknown

  • Modeling and solving a Crew Assignment Problem in air transportation

    F. M. Zeghal;F. M. Zeghal;F. M. Zeghal;Michel Minoux;Michel Minoux

  • A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

    Unknown

  • Discrete Monotonic Optimization with Application to a Discrete Location Problem

    Hoang Tuy;Michel Minoux;N. T. Hoai-Phuong

  • Solving integer minimum cost flows with separable convex cost objective polynomially

    Unknown

  • Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions

    Unknown

  • Network Synthesis and Dynamic Network Optimization

    Michel Minoux

  • Dioïds and semirings: Links to fuzzy sets and other applications

    Unknown

  • Optimal matching of convex polygons

    Pedro Cox;Henri Maître;Michel Minoux;Celso C. Ribeiro

  • A heuristic approach to hard constrained shortest path problems

    Celso C. Ribeiro;Michel Minoux

  • Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

    P. Bonami;M. Minoux

  • Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems

    M. Minoux;K. Barkaoui

  • A compact optimization model for the tail assignment problem

    Oumaima Khaled;Oumaima Khaled;Michel Minoux;Vincent Mousseau;Stéphane Michel

  • Multicommodity Network Flow Models and Algorithms in Telecommunications

    Michel Minoux

  • Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization

    Endre Boros;Peter L. Hammer;Michel Minoux;David J. Rader

  • A multi-criteria repair/recovery framework for the tail assignment problem in airlines

    Oumaima Khaled;Oumaima Khaled;Michel Minoux;Vincent Mousseau;Stéphane Michel

  • Capacitated Lot Sizing models: a literature review

    Céline Gicquel;Michel Minoux;Yves Dallery

Frequent Co-Authors

Pierre Hansen
Pierre Hansen HEC Montréal
Yves Dallery
Yves Dallery CentraleSupélec
Martine Labbé
Martine Labbé Université Libre de Bruxelles
Peter L. Hammer
Peter L. Hammer Rutgers, The State University of New Jersey
Endre Boros
Endre Boros Rutgers, The State University of New Jersey
Celso C. Ribeiro
Celso C. Ribeiro Fluminense Federal University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As demand for tech professionals keeps rising, online degrees are making it easier than ever to launch or advance your career in Computer Science and related fields. One attractive option for those eager to join the workforce quickly is pursuing the fastest computer science degree. These accelerated programs can help you complete your studies in less time while maintaining academic rigor.

For tech enthusiasts interested in addressing global challenges, an online environmental engineering degree science and engineering pathway blends computer skills with environmental problem-solving. Such interdisciplinary knowledge is highly valued in today’s workforce.

Engineering remains a rewarding field with promising online options. If you wish for a cost-effective route into advanced engineering, you might consider the cheapest online master's mechanical engineering program. Similarly, those intrigued by foundational sciences can benefit from the cheapest online physics degree, opening paths into research, data science, or education.

These related degrees provide flexible learning opportunities and diverse career pathways for students passionate about technology and innovation.

Best Scientists Citing Michel Minoux

Trending Scientists

Recently Published Articles