logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A grid-aware MIP solver: Implementation and case studies

delete2008-02-01
delete5
PRE
AI
S
Sonya Marcarelli
I
Igor Vasilyev
U
Umberto Villano *
DOI：10.1016/j.future.2007.03.011delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists of two solvers and an interface portal. After a brief introduction to Branch, Cut and Price optimization algorithms, the paper focuses on the system architecture, solvers and portal user interface. The performance of the system is measured and analysed on a small-scale grid environment consisting of three clusters on a campus LAN. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
BRANCH
PRICE
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
Papers:
6.8K
Citations:
2.3W

Organization

No organization information available