Global and Local Search Algorithms for Concave Cost Transshipment Problems

Author： Yan Shangyao   Juang Der-shin   Chen Chien-rong   Lai Wei-shen  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.33, Iss.1, 2005-09, pp. : 123-156

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

On a Local and Global Search Involved in Nonconvex Optimization Problems

By Strekalovsky A. S.   Yakovleva T. V.  

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 375-387

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Algorithms to solve some problems of concave programming with linear constraints

By Sergeev S.  

Automation and Remote Control, Vol. 68, Iss. 3, 2007-03 ,pp. : 399-412

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Generic Incremental Algorithms for Local Search

By Ågren Magnus   Flener Pierre   Pearson Justin  

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 293-324

Springer Publishing Company

Access to resources Recommend Favorite

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

By Brucker Peter   Kampmeyer Thomas  

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 303-322

Springer Publishing Company

Access to resources Recommend Favorite

Adding Local Contrast to Global Gamut Mapping Algorithms

By Zolliker Peter   Simon Klaus  

Conference on Colour in Graphics, Imaging, and Vision, Vol. 2006, Iss. 1, 2006-01 ,pp. : 257-261

Society for Imaging Science and Technology

Access to resources Recommend Favorite