Finding Robust Solutions Using Local Search

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.3, Iss.1, 2004-01, pp. : 89-103

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Finding optimal solutions to the graph partitioning problem with heuristic search

By Felner Ariel

Annals of Mathematics and Artificial Intelligence, Vol. 45, Iss. 3-4, 2005-12 ,pp. : 293-322

Springer Publishing Company

Access to resources Recommend Favorite

Increasing Internet Capacity Using Local Search

By Fortz Bernard Thorup Mikkel

Computational Optimization and Applications, Vol. 29, Iss. 1, 2004-10 ,pp. : 13-48

Springer Publishing Company

Access to resources Recommend Favorite

Finding all Solutions of Systems of Nonlinear Equations Using the Dual Simplex Method

By Yamamura K.

Bit Numerical Mathematics, Vol. 42, Iss. 1, 2002-01 ,pp. : 214-230

Springer Publishing Company

Access to resources Recommend Favorite

A local search using solution fragments for the 2-machine bicriteria scheduling problem

By Huang Gaofeng Lim Andrew Rodrigues Brian

Computational Optimization and Applications, Vol. 37, Iss. 2, 2007-06 ,pp. : 219-229

Springer Publishing Company

Access to resources Recommend Favorite

Finding All Solutions to the Magic Hexagram

By Karabegov Alexander Holland Jason

The College Mathematics Journal, Vol. 39, Iss. 2, 2008-03 ,pp. : 102-106

Mathematical Association of America

Access to resources Recommend Favorite