| Publication | Date of Publication | Type |
|---|
Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
Optimization Letters | 2021-07-08 | Paper |
Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
Journal of Global Optimization | 2019-12-03 | Paper |
A class of efficiently solvable multistage optimization problems under uncertainty and applications
IMA Journal of Management Mathematics | 2019-06-18 | Paper |
The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
Algorithmica | 2019-01-11 | Paper |
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Networks | 2018-06-13 | Paper |
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
Discrete Optimization | 2018-05-24 | Paper |
Improved linearized models for graph partitioning problem under capacity constraints
Optimization Methods \& Software | 2017-11-24 | Paper |
A compact optimization model for the tail assignment problem
European Journal of Operational Research | 2017-11-23 | Paper |
Global probability maximization for a Gaussian bilateral inequality in polynomial time
Journal of Global Optimization | 2017-11-02 | Paper |
scientific article; zbMATH DE number 6791533 (Why is no real title available?)
| 2017-10-16 | Paper |
A distribution network design problem in the automotive industry: MIP formulation and heuristics
Computers \& Operations Research | 2016-11-10 | Paper |
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
Computers \& Operations Research | 2016-11-10 | Paper |
Stochastic graph partitioning: quadratic versus SOCP formulations
Optimization Letters | 2016-10-27 | Paper |
Improved compact formulations for metric and cut polyhedra
| 2016-10-18 | Paper |
Convexity of Gaussian chance constraints and of related probability maximization problems
Computational Statistics | 2016-08-04 | Paper |
A characterization of the subdifferential of singular Gaussian distribution functions
Set-Valued and Variational Analysis | 2015-09-02 | Paper |
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
Optimization Letters | 2015-03-23 | Paper |
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
European Journal of Operational Research | 2015-02-04 | Paper |
Two-stage robust optimization, state-space representable uncertainty and applications
RAIRO. Operations Research | 2014-11-07 | Paper |
Solving some multistage robust decision problems with huge implicitly defined scenario trees
Algorithmic Operations Research | 2013-12-11 | Paper |
Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
| 2013-11-08 | Paper |
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
Optimization Letters | 2012-12-11 | Paper |
On discrete lot-sizing and scheduling on identical parallel machines
Optimization Letters | 2012-11-30 | Paper |
Compact versus noncompact LP formulations for minimizing convex Choquet integrals
Discrete Applied Mathematics | 2012-11-22 | Paper |
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
Computers \& Operations Research | 2012-11-15 | Paper |
On the solution of a graph partitioning problem under capacity constraints
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
International Journal of Production Research | 2011-05-10 | Paper |
On 2-stage robust LP with RHS uncertainty: complexity results and applications
Journal of Global Optimization | 2011-03-14 | Paper |
A comparison of some valid inequality generation methods for general \(0\)-\(1\) problems
| 2011-01-03 | Paper |
DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
Discrete Applied Mathematics | 2010-11-25 | Paper |
Accelerating Benders method using covering cut bundle generation
International Transactions in Operational Research | 2010-05-31 | Paper |
Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
Discrete Applied Mathematics | 2010-05-05 | Paper |
Optimizing glass coating lines: MIP model and valid inequalities
European Journal of Operational Research | 2009-11-27 | Paper |
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
International Transactions in Operational Research | 2009-10-21 | Paper |
On robust maximum flow with polyhedral uncertainty sets
Optimization Letters | 2009-09-03 | Paper |
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Discrete Optimization | 2009-06-02 | Paper |
Graphs and algorithms
| 2009-05-26 | Paper |
Discrete lot sizing and scheduling using product decomposition into attributes
Computers \& Operations Research | 2009-04-03 | Paper |
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
Operations Research Letters | 2009-02-23 | Paper |
Models and algorithms for robust PERT scheduling with time-dependent tast durations
Vietnam Journal of Mathematics | 2008-07-29 | Paper |
Mathematical programming. Theory and algorithms.
| 2008-06-17 | Paper |
Exact MAX-2SAT solution via lift-and-project closure
Operations Research Letters | 2008-01-15 | Paper |
Graphs, dioids and semirings. New models and algorithms.
Operations Research/Computer Science Interfaces Series | 2007-10-22 | Paper |
Dioïds and semirings: Links to fuzzy sets and other applications
Fuzzy Sets and Systems | 2007-07-26 | Paper |
Multicommodity network flow models and algorithms in telecommunications
| 2007-07-23 | Paper |
Joint optimization of pricing and resource allocation in competitive telecommunications networks
Networks | 2007-07-20 | Paper |
Modeling and solving a crew assignment problem in air transportation
European Journal of Operational Research | 2006-10-25 | Paper |
Discrete Monotonic Optimization with Application to a Discrete Location Problem
SIAM Journal on Optimization | 2006-05-30 | Paper |
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems
Discrete Applied Mathematics | 2004-11-12 | Paper |
An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
International Transactions in Operational Research | 2003-05-14 | Paper |
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
Operations Research Letters | 2003-04-03 | Paper |
Extension of MacMahon's master theorem to pre-semi-rings
Linear Algebra and its Applications | 2002-09-06 | Paper |
Discrete cost multicommodity network optimization problems and exact solution methods
Annals of Operations Research | 2002-06-09 | Paper |
Eigenvalues and eigen-functionals of diagonally dominant endomorphisms in Min-Max analysis
Linear Algebra and its Applications | 2002-05-29 | Paper |
Graphs, dioids and semi-rings. New models and algorithms
| 2002-04-10 | Paper |
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters | 2001-09-03 | Paper |
A generalization of the all minors matrix tree theorem to semirings
Discrete Mathematics | 2000-01-09 | Paper |
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Discrete Applied Mathematics | 1999-05-25 | Paper |
Valeurs propres et fonctions propres d'endomorphismes à diagonale dominante en analyse Min-Max
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 1998-05-25 | Paper |
LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
Acta Mathematica Vietnamica | 1998-04-13 | Paper |
Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
Discrete Mathematics | 1998-01-19 | Paper |
A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
RAIRO - Operations Research | 1997-09-02 | Paper |
The unique Horn-satisfiability problem and quadratic Boolean equations.
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
scientific article; zbMATH DE number 849074 (Why is no real title available?)
| 1996-02-28 | Paper |
On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
Annals of Operations Research | 1996-01-07 | Paper |
Optimal matching of convex polygons
Pattern Recognition Letters | 1994-10-30 | Paper |
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
Numerical Algorithms | 1994-06-13 | Paper |
Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm
RAIRO - Operations Research | 1994-01-01 | Paper |
scientific article; zbMATH DE number 279291 (Why is no real title available?)
| 1993-08-22 | Paper |
scientific article; zbMATH DE number 193847 (Why is no real title available?)
| 1993-06-05 | Paper |
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
Discrete Applied Mathematics | 1990-01-01 | Paper |
Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
INFOR: Information Systems and Operational Research | 1990-01-01 | Paper |
Networks synthesis and optimum network design problems: Models, solution methods and applications
Networks | 1989-01-01 | Paper |
An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
European Journal of Operational Research | 1989-01-01 | Paper |
Solving combinatorial problems with combined min-max-min-sum objective and applications
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
A new algorithm for general matching problems using network flow subproblems
Networks | 1989-01-01 | Paper |
Finite precision design of FIR digital filters using a convexity property
IEEE Transactions on Acoustics, Speech, and Signal Processing | 1988-01-01 | Paper |
LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
Information Processing Letters | 1988-01-01 | Paper |
A new approach for crew pairing problems by column generation with an application to air transportation
European Journal of Operational Research | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4027150 (Why is no real title available?)
| 1987-01-01 | Paper |
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
RAIRO - Operations Research | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4018774 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3972625 (Why is no real title available?)
| 1986-01-01 | Paper |
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
Mathematical Programming | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3961370 (Why is no real title available?)
| 1986-01-01 | Paper |
Solving integer minimum cost flows with separable convex cost objective polynomially
Mathematical Programming Studies | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3988689 (Why is no real title available?)
| 1986-01-01 | Paper |
Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
RAIRO - Operations Research | 1986-01-01 | Paper |
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
Information Processing Letters | 1986-01-01 | Paper |
A heuristic approach to hard constrained shortest path problems
Discrete Applied Mathematics | 1985-01-01 | Paper |
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
Discrete Applied Mathematics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3906559 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3989126 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3843497 (Why is no real title available?)
| 1984-01-01 | Paper |
A polynomial algorithm for minimum quadratic cost flow problems
European Journal of Operational Research | 1984-01-01 | Paper |
A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
Operations Research Letters | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3871019 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3810911 (Why is no real title available?)
| 1982-01-01 | Paper |
Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints
RAIRO - Operations Research | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3743018 (Why is no real title available?)
| 1981-01-01 | Paper |
Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
North-Holland Mathematics Studies | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3689180 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3765557 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3708436 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3659253 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3783030 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3580314 (Why is no real title available?)
| 1978-01-01 | Paper |
Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions
RAIRO - Operations Research | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3495889 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3523307 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3542191 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3543768 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3526709 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3503306 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3478600 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3497612 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3443434 (Why is no real title available?)
| 1974-01-01 | Paper |
scientific article; zbMATH DE number 3443435 (Why is no real title available?)
| 1974-01-01 | Paper |
Brève communication. Une méthode de résolution des problèmes de col
Revue française d'automatique informatique recherche opérationnelle. Mathématique | 1973-01-01 | Paper |
