The Tera-Gridiron: A Natural Turf for High-Throughput Computing (2008)
Jeff Linderoth, François Margot, Greg Thain
Abstract — Teragrid resources are often used when high-performance computing is required. We describe our experiences in using Teragrid resources in a high-throughput manner, generating a...
Guoming Lai, François Margot, Nicola Secom
The valuation of the real option to store natural gas is a practically important problem that entails dynamic optimization of inventory trading decisions with capacity constraints in the face of...
Jeff Linderoth, François Margot, Greg Thain
The Football Pool Problem, which gets its name from a lottery-type game where partici-pants predict the outcome of soccer matches, is to determine the smallest covering code of radius one of ternary...
Optimization for Simulation: LAD Accelerator (2007)
Miguel A. Lejeune, François Margot
The goal of this paper is to address the problem of evaluating the performance of a system running under unknown values for its stochastic parameters. A new approach called LAD for Simulation, based...
Testing Cut Generators for Mixed-Integer Linear Programming (2007)
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is presented. The procedure amounts to random diving towards a feasible...
A Feasibility Pump for Mixed Integer Nonlinear Programs (2006)
Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot
Abstract We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, ...
algorithmic framework for convex mixed integer
Small Covering Designs by Branch-and-Cut (2000)
A Branch-and-Cut algorithm for nding covering designs is presented. Its originality resides in the use of isomorphism pruning of the enumeration tree. A proof that no 4 (10; 5; 1)-covering design...
Gérard Cornuéjols, G Erard, François Margot, Cornu Ejols, Bertrand Guenin, ...
. A clutter (V; E) packs if the smallest number of vertices needed to intersect all the edges (i.e. a transversal) is equal to the maximum number of pairwise disjoint edges (i.e. a matching). This...
Weak K-Majorization and Polyhedra (1996)
Geir Dahl, Geir Dahl, François Margot, Francois Margot
For integers k and n with k # n a vector x # R n is said to be weakly k-majorized by a vector q # R k if the sum of the r largest components of x does not exceed the sum of the r largest components...
Weak K-Majorization and Polyhedra (1995)
For integers k and n with k # n avector x 2 R n is said to be weakly k-majorized byavector q 2 R k if the sum of the r largest components of x does not exceed the sum of the r largest components of...
Weak K-Majorization and Polyhedra (1995)
For integers k and n with k n a vector x 2 R n is said to be weakly k-majorized by a vector q 2 R k if the sum of the r largest components of x does not exceed the sum of the r largest components of...