网上购物 货比三家
女用仿真 戏曲 惠氏 复印机 牛仔裤 等离子电视 明治 国产表店 数码伴侣 男根套环 充气娃娃 女鞋 电影/戏剧 电池/充电器 扫描仪/扫描枪 液晶电视

全部商品分类

热搜：
保湿加湿器诺基亚
您现在的位置：快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

计算组合优化：优化或可证实近优化方案Computational Combinatorial Optimization

分享到：
计算组合优化：优化或可证实近优化方案Computational Combinatorial Optimization

最 低 价：￥99.00

定 价：￥110.00

作 者：MichaelJuger， DenisNaddef　著 著

出 版 社：Oversea Publishing House

出版时间：2001-1-1

I S B N：9783540428770

  • 价格比较
  • 商品详情
  • 商品评论(0条)

    • 商品详情

    编辑推荐

    内容简介
    Increasing competition in the industrial and service sectors has to a demand for optimal or provably near-optimal solutions to large scale optimization problems，and the exploration of a much large range of alternatives in the race to improve productivity and effciency.Many such decision problems involve the choice between a finite set of alternatives.Combinatorial Optimization involves careful modeling of the problems，the machematical analysis of the resulting discrete structuree，the development of algorithm and their analysis，and the implementation of software to produce practical solutions.
    　　This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques， with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives， in particular， polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems， e.g.， in production and transport planning， are treated in many places; in particular， the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

    作者简介

    目录
    General Mixed Integer Programming:Computational Issues for Bran-and-Cut Algorithms
    Projection and Lifting in Combinatorial Optimization
    Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
    Lagrangian Relaxation
    Branch-and Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
    Matthias FIF（Uniuersity of Cologne），Carsten Gutweenger（caesar Foundation Bonn），Michael Junger（Uniuersity of Cologne），Giouanni Rinaldi（IASI-CNR Rome）
    Branch，Cut，and Price:Sequential and Parallel
    TSP Cuts Which Do Not Conform to the Template Paradigm
    Author Index

    商品评论（0条）

    暂无评论！

    相关新品推荐

    浏览更多同类商品

    您的浏览历史

    loading 内容加载中，请稍后...
    免责声明:

    本网站为购物搜索引擎,只提供各网站商品及服务信息链接,以商家实际信息为准!

    关于比价网 | 合作网站 | 免责声明 | 联系我们 (京ICP备13007221号-2)
    © 2008-2012 Bijia123.cn. All rights reserved.