Sciweavers

231 search results - page 1 / 47
» Computational experience with exterior point algorithms for ...
Sort
View
AMC
2004
79views more  AMC 2004»
13 years 5 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 5 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
IOR
2006
173views more  IOR 2006»
13 years 5 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
ICCS
2003
Springer
13 years 10 months ago
Monte Carlo Method for Calculating the Electrostatic Energy of a Molecule
The problem of computing the electrostatic energy of a large molecule is considered. It is reduced to solving the Poisson equation inside and the linear Poisson-Boltzmann equation ...
Michael Mascagni, Nikolai A. Simonov
EOR
2008
200views more  EOR 2008»
13 years 5 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...