The following pages link to John E. Mitchell (Q181226):
Displaying 50 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Global resolution of the support vector machine regression parameters selection problem with LPCC (Q748597) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656) (← links)
- Stratified filtered sampling in stochastic optimization (Q1568373) (← links)
- A penalty method for rank minimization problems in symmetric matrices (Q1616933) (← links)
- A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- (Q1780597) (redirect page) (← links)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- Low-rank factorization for rank minimization with nonconvex regularizers (Q2044472) (← links)
- Two relaxation methods for rank minimization problems (Q2198528) (← links)
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
- P-hub approach for the optimal park-and-ride facility location problem (Q2253566) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems (Q2393483) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- Optimal placement of stereo sensors (Q2465570) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach (Q2505315) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- (Q2735076) (← links)
- A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints (Q2848190) (← links)
- An Analytic Center Cutting Plane Approach for Conic Programming (Q3168981) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- On the Global Solution of Linear Programs with Linear Complementarity Constraints (Q3608991) (← links)
- Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
- A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables (Q3819909) (← links)
- (Q4233341) (← links)
- (Q4247439) (← links)
- An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers (Q4302320) (← links)
- (Q4347851) (← links)
- (Q4355917) (← links)
- (Q4375770) (← links)
