| Publication | Date of Publication | Type |
|---|
Shortest path network interdiction with asymmetric uncertainty
Networks | 2024-03-15 | Paper |
Optimizing edge sets in networks to produce ground truth communities based on modularity
Networks | 2023-12-12 | Paper |
Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach
Networks | 2023-12-11 | Paper |
Interdicting restructuring networks with applications in illicit trafficking
European Journal of Operational Research | 2023-07-10 | Paper |
| Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks | 2022-09-09 | Paper |
Low-rank factorization for rank minimization with nonconvex regularizers
Computational Optimization and Applications | 2021-08-09 | Paper |
| Complementarity formulations of \(\ell_0\)-norm optimization | 2021-02-03 | Paper |
Two relaxation methods for rank minimization problems
Journal of Optimization Theory and Applications | 2020-09-10 | Paper |
An enhanced logical benders approach for linear programs with complementarity constraints
Journal of Global Optimization | 2020-08-07 | Paper |
Scheduling of tasks with effectiveness precedence constraints
Optimization Letters | 2020-02-27 | Paper |
Solving linear programs with complementarity constraints using branch-and-cut
Mathematical Programming Computation | 2019-12-19 | Paper |
A penalty method for rank minimization problems in symmetric matrices
Computational Optimization and Applications | 2018-11-07 | Paper |
A fair division approach to humanitarian logistics inspired by conditional value-at-risk
Annals of Operations Research | 2018-06-13 | Paper |
Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
Discrete Optimization | 2018-05-24 | Paper |
Applying ranking and selection procedures to long-term mitigation for improved network restoration
EURO Journal on Computational Optimization | 2016-11-11 | Paper |
Interdependent network restoration: on the value of information-sharing
European Journal of Operational Research | 2016-10-06 | Paper |
On conic QPCCs, conic QCQPs and completely positive programs
Mathematical Programming. Series A. Series B | 2016-09-16 | Paper |
Obtaining tighter relaxations of mathematical programs with complementarity constraints
Springer Proceedings in Mathematics & Statistics | 2015-12-03 | Paper |
Global resolution of the support vector machine regression parameters selection problem with LPCC
EURO Journal on Computational Optimization | 2015-10-29 | Paper |
An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
Journal of Global Optimization | 2015-06-22 | Paper |
Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
European Journal of Operational Research | 2014-07-27 | Paper |
P-hub approach for the optimal park-and-ride facility location problem
European Journal of Operational Research | 2014-07-27 | Paper |
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Optimization Letters | 2014-04-30 | Paper |
Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Optimization Methods & Software | 2014-02-07 | Paper |
A globally convergent probability-one homotopy for linear programs with linear complementarity constraints
SIAM Journal on Optimization | 2013-09-25 | Paper |
Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
Annals of Operations Research | 2013-08-08 | Paper |
On convex quadratic programs with linear complementarity constraints
Computational Optimization and Applications | 2013-06-28 | Paper |
Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs
Optimization Methods & Software | 2013-06-24 | Paper |
| scientific article; zbMATH DE number 6135091 (Why is no real title available?) | 2013-02-07 | Paper |
On linear programs with linear complementarity constraints
Journal of Global Optimization | 2012-09-20 | Paper |
An LPCC approach to nonconvex quadratic programs
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
An analytic center cutting plane approach for conic programming
Mathematics of Operations Research | 2011-04-27 | Paper |
Logic-based MultiObjective Optimization for Restoration Planning
Springer Optimization and Its Applications | 2009-10-27 | Paper |
A second-order cone cutting surface method: Complexity and application
Computational Optimization and Applications | 2009-09-02 | Paper |
On the Global Solution of Linear Programs with Linear Complementarity Constraints
SIAM Journal on Optimization | 2009-03-06 | Paper |
Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
Mathematical Methods of Operations Research | 2008-04-23 | Paper |
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
Discrete Optimization | 2008-02-22 | Paper |
Optimal placement of stereo sensors
Optimization Letters | 2008-01-04 | Paper |
| Interior point methods for large-scale linear programming | 2007-07-23 | Paper |
Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
International Journal of Operational Research | 2006-10-04 | Paper |
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
Computational Optimization and Applications | 2006-09-28 | Paper |
A unifying framework for several cutting plane methods for semidefinite programming
Optimization Methods & Software | 2006-03-29 | Paper |
A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
Computational Optimization and Applications | 2005-08-05 | Paper |
Using selective orthonormalization to update the analytic center after addition of multiple cuts
Journal of Optimization Theory and Applications | 2005-06-13 | Paper |
Polynomial Interior Point Cutting Plane Methods
Optimization Methods & Software | 2005-03-07 | Paper |
Realignment in the National Football League: Did they do it right?
Naval Research Logistics | 2004-03-15 | Paper |
| scientific article; zbMATH DE number 1985305 (Why is no real title available?) | 2003-09-24 | Paper |
| A homogenized cutting plane method to solve the convex feasibility problem. | 2001-12-13 | Paper |
Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
Journal of Combinatorial Optimization | 2001-09-19 | Paper |
| scientific article; zbMATH DE number 1489805 (Why is no real title available?) | 2001-08-05 | Paper |
A long-step, cutting plane algorithm for linear and convex programming
Annals of Operations Research | 2001-06-14 | Paper |
An ellipsoid algorithm for equality-constrained nonlinear programs
Computers & Operations Research | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1489804 (Why is no real title available?) | 2000-10-23 | Paper |
Computational Experience with an Interior Point Cutting Plane Algorithm
SIAM Journal on Optimization | 2000-10-19 | Paper |
Stratified filtered sampling in stochastic optimization
Journal of Applied Mathematics and Decision Sciences | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1302172 (Why is no real title available?) | 2000-04-19 | Paper |
| scientific article; zbMATH DE number 1264409 (Why is no real title available?) | 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
European Journal of Operational Research | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1064586 (Why is no real title available?) | 1999-01-04 | Paper |
| scientific article; zbMATH DE number 1114003 (Why is no real title available?) | 1998-06-02 | Paper |
A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
Computers & Operations Research | 1997-10-26 | Paper |
| scientific article; zbMATH DE number 1047684 (Why is no real title available?) | 1997-08-11 | Paper |
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
Annals of Operations Research | 1996-07-01 | Paper |
A primal-dual interior-point method for linear programming based on a weighted barrier function
Journal of Optimization Theory and Applications | 1996-02-06 | Paper |
An alternative derivation of the projective interior point method for linear programming through the least squares approach
Optimization | 1995-05-08 | Paper |
An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
SIAM Journal on Optimization | 1994-08-14 | Paper |
Updating lower bounds when using Karmarkar's projective algorithm for linear programming
Journal of Optimization Theory and Applications | 1994-04-27 | Paper |
An improved branch and bound algorithm for mixed integer nonlinear programs
Computers & Operations Research | 1994-03-27 | Paper |
Solving combinatorial optimization problems using Karmarkar's algorithm
Mathematical Programming. Series A. Series B | 1992-12-17 | Paper |
| scientific article; zbMATH DE number 4197736 (Why is no real title available?) | 1990-01-01 | Paper |
A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
SIAM Journal on Matrix Analysis and Applications | 1989-01-01 | Paper |
