Mitchell John E.

John E. Mitchell

Information about the author John E. Mitchell will soon be added to the site.
Found 12 papers in total
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
2007
Given a complete graph K n =(V,E) with edge weight c e on each edge, we consider the...
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
2006
We investigate solution of the maximum cut problem using a polyhedral cut and price...
Finding optimal realignments in sports leagues using a branch-and-cut-price approach
Finding optimal realignments in sports leagues using a branch-and-cut-price approach
2005
The sports team realignment problem can be modeled as k-way equipartition: given a...
Polynomial interior point cutting plane methods
Polynomial interior point cutting plane methods
2003
Polynomial cutting plane methods based on the logarithmic barrier function and on the...
Realignment in the National Football Leagues: did they do it right?
Realignment in the National Football Leagues: did they do it right?
2003
The National Football Leagues (NFL) in the United States expanded to 32 teams in 2002...
A long-step, cutting plane algorithm for linear and convex programming
A long-step, cutting plane algorithm for linear and convex programming
2000
A cutting plane method for linear programming is described. This method is an...
An ellipsoid algorithm for equality-constrained nonlinear programs
An ellipsoid algorithm for equality-constrained nonlinear programs
2001
This paper describes an ellipsoid algorithm that solves convex problems having linear...
Stratified filtered sampling in stochastic optimization
Stratified filtered sampling in stochastic optimization
2000
We develop a methodology for evaluating a decision strategy generated by a stochastic...
Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
1997
Branch and cut methods for integer programming problems solve a sequence of linear...
A computational comparison of branch and bound and outer approximation algorithms for 0–1 mixed integer nonlinear programs
A computational comparison of branch and bound and outer approximation algorithms for 0–1 mixed integer nonlinear programs
1997
In this paper we compare the performance of two codes for convex 0–1 mixed...
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
1996
Cutting plane methods require the solution of a sequence of linear programs, where the...
An improved branch and bound algorithm for mixed integer nonlinear programs
An improved branch and bound algorithm for mixed integer nonlinear programs
1994
This paper describes an improved branch and bound code for zero-one mixed integer...
Papers per page: