Sciweavers

MP
2002
77views more  MP 2002»
13 years 4 months ago
Polyhedral results for the edge capacity polytope
Stan P. M. van Hoesel, Arie M. C. A. Koster, Rober...
MP
2002
183views more  MP 2002»
13 years 4 months ago
On splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc
Alper Atamtürk, Deepak Rajan
MP
2002
195views more  MP 2002»
13 years 4 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
MP
2002
85views more  MP 2002»
13 years 4 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
MP
2002
96views more  MP 2002»
13 years 4 months ago
On capacitated network design cut-set polyhedra
Abstract. This paper provides an analysis of capacitated network design cut
Alper Atamtürk
MP
2002
66views more  MP 2002»
13 years 4 months ago
A faster capacity scaling algorithm for minimum cost submodular flow
Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
MP
2002
110views more  MP 2002»
13 years 4 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski
MP
2002
101views more  MP 2002»
13 years 4 months ago
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
MP
2002
176views more  MP 2002»
13 years 4 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell