| Publication | Date of Publication | Type |
|---|
| Shortest path network interdiction with asymmetric uncertainty | 2024-03-15 | Paper |
| Optimizing edge sets in networks to produce ground truth communities based on modularity | 2023-12-12 | Paper |
| Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach | 2023-12-11 | Paper |
| Interdicting restructuring networks with applications in illicit trafficking | 2023-07-10 | Paper |
| Low-rank factorization for rank minimization with nonconvex regularizers | 2021-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5148366 | 2021-02-03 | Paper |
| Two relaxation methods for rank minimization problems | 2020-09-10 | Paper |
| An enhanced logical benders approach for linear programs with complementarity constraints | 2020-08-07 | Paper |
| Scheduling of tasks with effectiveness precedence constraints | 2020-02-27 | Paper |
| Solving linear programs with complementarity constraints using branch-and-cut | 2019-12-19 | Paper |
| A penalty method for rank minimization problems in symmetric matrices | 2018-11-07 | Paper |
| A fair division approach to humanitarian logistics inspired by conditional value-at-risk | 2018-06-13 | Paper |
| Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems | 2018-05-24 | Paper |
| Applying ranking and selection procedures to long-term mitigation for improved network restoration | 2016-11-11 | Paper |
| On conic QPCCs, conic QCQPs and completely positive programs | 2016-09-16 | Paper |
| Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints | 2015-12-03 | Paper |
| Global resolution of the support vector machine regression parameters selection problem with LPCC | 2015-10-29 | Paper |
| An algorithm for global solution to bi-parametric linear complementarity constrained linear programs | 2015-06-22 | Paper |
| Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem | 2014-07-27 | Paper |
| P-hub approach for the optimal park-and-ride facility location problem | 2014-07-27 | Paper |
| Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints | 2014-04-30 | Paper |
| Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs | 2014-02-07 | Paper |
| A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints | 2013-09-25 | Paper |
| Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems | 2013-08-08 | Paper |
| On convex quadratic programs with linear complementarity constraints | 2013-06-28 | Paper |
| Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs | 2013-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906149 | 2013-02-07 | Paper |
| On linear programs with linear complementarity constraints | 2012-09-20 | Paper |
| An LPCC approach to nonconvex quadratic programs | 2012-06-26 | Paper |
| An Analytic Center Cutting Plane Approach for Conic Programming | 2011-04-27 | Paper |
| Logic-based MultiObjective Optimization for Restoration Planning | 2009-10-27 | Paper |
| A second-order cone cutting surface method: Complexity and application | 2009-09-02 | Paper |
| On the Global Solution of Linear Programs with Linear Complementarity Constraints | 2009-03-06 | Paper |
| Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms | 2008-04-23 | Paper |
| Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement | 2008-02-22 | Paper |
| Optimal placement of stereo sensors | 2008-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294040 | 2007-07-23 | Paper |
| Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach | 2006-10-04 | Paper |
| A semidefinite programming based polyhedral cut and price approach for the maxcut problem | 2006-09-28 | Paper |
| A unifying framework for several cutting plane methods for semidefinite programming | 2006-03-29 | Paper |
| A semidefinite programming heuristic for quadratic programming problems with complementarity constraints | 2005-08-05 | Paper |
| Using selective orthonormalization to update the analytic center after addition of multiple cuts | 2005-06-13 | Paper |
| Polynomial Interior Point Cutting Plane Methods | 2005-03-07 | Paper |
| Realignment in the National Football League: Did they do it right? | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429169 | 2003-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2735076 | 2001-12-13 | Paper |
| Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems | 2001-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496022 | 2001-08-05 | Paper |
| A long-step, cutting plane algorithm for linear and convex programming | 2001-06-14 | Paper |
| An ellipsoid algorithm for equality-constrained nonlinear programs | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496021 | 2000-10-23 | Paper |
| Computational Experience with an Interior Point Cutting Plane Algorithm | 2000-10-19 | Paper |
| Stratified filtered sampling in stochastic optimization | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247439 | 2000-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233341 | 1999-03-16 | Paper |
| Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355917 | 1999-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375770 | 1998-06-02 | Paper |
| A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs | 1997-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347851 | 1997-08-11 | Paper |
| Solving real-world linear ordering problems using a primal-dual interior point cutting plane method | 1996-07-01 | Paper |
| A primal-dual interior-point method for linear programming based on a weighted barrier function | 1996-02-06 | Paper |
| An alternative derivation of the projective interior point method for linear programming through the least squares approach | 1995-05-08 | Paper |
| An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers | 1994-08-14 | Paper |
| Updating lower bounds when using Karmarkar's projective algorithm for linear programming | 1994-04-27 | Paper |
| An improved branch and bound algorithm for mixed integer nonlinear programs | 1994-03-27 | Paper |
| Solving combinatorial optimization problems using Karmarkar's algorithm | 1992-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202835 | 1990-01-01 | Paper |
| A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables | 1989-01-01 | Paper |
