The following pages link to Michel Minoux (Q325411):
Displaying 50 items.
- (Q229791) (redirect page) (← links)
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← links)
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- A characterization of the subdifferential of singular Gaussian distribution functions (Q494871) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
- On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- Convexity of Gaussian chance constraints and of related probability maximization problems (Q736601) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- On robust maximum flow with polyhedral uncertainty sets (Q839800) (← links)
- Models and algorithms for robust PERT scheduling with time-dependent tast durations (Q934191) (← links)
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
- Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Optimizing glass coating lines: MIP model and valid inequalities (Q1040997) (← links)
- A heuristic approach to hard constrained shortest path problems (Q1063522) (← links)
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- A new approach for crew pairing problems by column generation with an application to air transportation (Q1098764) (← links)
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation (Q1111776) (← links)
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
- A generalization of the all minors matrix tree theorem to semirings (Q1297437) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
- The unique Horn-satisfiability problem and quadratic Boolean equations. (Q1353999) (← links)
- Bideterminants, arborescences and extension of the matrix-tree theorem to semirings (Q1363700) (← links)
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428) (← links)
- Discrete cost multicommodity network optimization problems and exact solution methods (Q1599297) (← links)
- Global probability maximization for a Gaussian bilateral inequality in polynomial time (Q1675587) (← links)
- A compact optimization model for the tail assignment problem (Q1681506) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Compact versus noncompact LP formulations for minimizing convex Choquet integrals (Q1759877) (← links)
- A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints (Q1762015) (← links)
- Eigenvalues and eigen-functionals of diagonally dominant endomorphisms in Min-Max analysis (Q1809088) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems (Q1885820) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Dioïds and semirings: Links to fuzzy sets and other applications (Q2372262) (← links)
- Modeling and solving a crew assignment problem in air transportation (Q2432845) (← links)