| Publication | Date of Publication | Type |
|---|
| Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results | 2021-07-08 | Paper |
| Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems | 2019-12-03 | Paper |
| A class of efficiently solvable multistage optimization problems under uncertainty and applications | 2019-06-18 | Paper |
| The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases | 2019-01-11 | Paper |
| Reduced‐size formulations for metric and cut polyhedra in sparse graphs | 2018-06-13 | Paper |
| Improved compact formulations for a wide class of graph partitioning problems in sparse graphs | 2018-05-24 | Paper |
| Improved linearized models for graph partitioning problem under capacity constraints | 2017-11-24 | Paper |
| A compact optimization model for the tail assignment problem | 2017-11-23 | Paper |
| Global probability maximization for a Gaussian bilateral inequality in polynomial time | 2017-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369252 | 2017-10-16 | Paper |
| A distribution network design problem in the automotive industry: MIP formulation and heuristics | 2016-11-10 | Paper |
| Multi-product valid inequalities for the discrete lot-sizing and scheduling problem | 2016-11-10 | Paper |
| Stochastic graph partitioning: quadratic versus SOCP formulations | 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 | 2016-08-04 | Paper |
| A characterization of the subdifferential of singular Gaussian distribution functions | 2015-09-02 | Paper |
| Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles | 2015-03-23 | Paper |
| An evaluation of semidefinite programming based approaches for discrete lot-sizing problems | 2015-02-04 | Paper |
| Two-stage robust optimization, state-space representable uncertainty and applications | 2014-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867357 | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861558 | 2013-11-08 | Paper |
| Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard | 2012-12-11 | Paper |
| On discrete lot-sizing and scheduling on identical parallel machines | 2012-11-30 | Paper |
| Compact versus noncompact LP formulations for minimizing convex Choquet integrals | 2012-11-22 | Paper |
| A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints | 2012-11-15 | Paper |
| On the Solution of a Graph Partitioning Problem under Capacity Constraints | 2012-11-02 | Paper |
| Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources | 2011-05-10 | Paper |
| On 2-stage robust LP with RHS uncertainty: complexity results and applications | 2011-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3061958 | 2011-01-03 | Paper |
| DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips | 2010-11-25 | Paper |
| Accelerating Benders method using covering cut bundle generation | 2010-05-31 | Paper |
| Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard | 2010-05-05 | Paper |
| Optimizing glass coating lines: MIP model and valid inequalities | 2009-11-27 | Paper |
| A strong flow-based formulation for the shortest path problem in digraphs with negative cycles | 2009-10-21 | Paper |
| On robust maximum flow with polyhedral uncertainty sets | 2009-09-03 | Paper |
| Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation | 2009-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3628775 | 2009-05-26 | Paper |
| Discrete lot sizing and scheduling using product decomposition into attributes | 2009-04-03 | Paper |
| On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times | 2009-02-23 | Paper |
| Models and algorithms for robust PERT scheduling with time-dependent tast durations | 2008-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3506696 | 2008-06-17 | Paper |
| Exact MAX-2SAT solution via lift-and-project closure | 2008-01-15 | Paper |
| Graphs, dioids and semirings. New models and algorithms. | 2007-10-22 | Paper |
| Dioïds and semirings: Links to fuzzy sets and other applications | 2007-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294047 | 2007-07-23 | Paper |
| Joint optimization of pricing and resource allocation in competitive telecommunications networks | 2007-07-20 | Paper |
| Modeling and solving a crew assignment problem in air transportation | 2006-10-25 | Paper |
| Discrete Monotonic Optimization with Application to a Discrete Location Problem | 2006-05-30 | Paper |
| Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems | 2004-11-12 | Paper |
| An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications | 2003-05-14 | Paper |
| A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems | 2003-04-03 | Paper |
| Extension of MacMahon's master theorem to pre-semi-rings | 2002-09-06 | Paper |
| Discrete cost multicommodity network optimization problems and exact solution methods | 2002-06-09 | Paper |
| Eigenvalues and eigen-functionals of diagonally dominant endomorphisms in Min-Max analysis | 2002-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2781754 | 2002-04-10 | Paper |
| Exact solution of multicommodity network optimization problems with general step cost functions | 2001-09-03 | Paper |
| A generalization of the all minors matrix tree theorem to semirings | 2000-01-09 | Paper |
| Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization | 1999-05-25 | Paper |
| Valeurs propres et fonctions propres d'endomorphismes à diagonale dominante en analyse Min-Max | 1998-05-25 | Paper |
| LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions | 1998-04-13 | Paper |
| Bideterminants, arborescences and extension of the matrix-tree theorem to semirings | 1998-01-19 | Paper |
| A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ | 1997-09-02 | Paper |
| The unique Horn-satisfiability problem and quadratic Boolean equations. | 1997-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4867319 | 1996-02-28 | Paper |
| On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions | 1996-01-07 | Paper |
| Optimal matching of convex polygons | 1994-10-30 | Paper |
| Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results | 1994-06-13 | Paper |
| Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5289277 | 1993-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4040645 | 1993-06-05 | Paper |
| Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity | 1990-01-01 | Paper |
| Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems | 1990-01-01 | Paper |
| An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment | 1989-01-01 | Paper |
| Solving combinatorial problems with combined min-max-min-sum objective and applications | 1989-01-01 | Paper |
| Networks synthesis and optimum network design problems: Models, solution methods and applications | 1989-01-01 | Paper |
| A new algorithm for general matching problems using network flow subproblems | 1989-01-01 | Paper |
| A new approach for crew pairing problems by column generation with an application to air transportation | 1988-01-01 | Paper |
| LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation | 1988-01-01 | Paper |
| Finite precision design of FIR digital filters using a convexity property | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030583 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768657 | 1987-01-01 | Paper |
| A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations | 1987-01-01 | Paper |
| An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs | 1986-01-01 | Paper |
| Solving integer minimum cost flows with separable convex cost objective polynomially | 1986-01-01 | Paper |
| A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730365 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738922 | 1986-01-01 | Paper |
| Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750987 | 1986-01-01 | Paper |
| A heuristic approach to hard constrained shortest path problems | 1985-01-01 | Paper |
| Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions | 1985-01-01 | Paper |
| A polynomial algorithm for minimum quadratic cost flow problems | 1984-01-01 | Paper |
| A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313622 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684177 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751390 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337942 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659128 | 1982-01-01 | Paper |
| Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints | 1981-01-01 | Paper |
| Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929543 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3857974 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883938 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900091 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947461 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960718 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4149262 | 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 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4077758 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083480 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101598 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103562 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4117605 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4118949 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062177 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079340 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4768873 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4768874 | 1974-01-01 | Paper |
| Brève communication. Une méthode de résolution des problèmes de col | 1973-01-01 | Paper |
