Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996 : proceedings
著者
書誌事項
Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996 : proceedings
(Lecture notes in computer science, 1084)
Springer, c1996
大学図書館所蔵 全61件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996.
The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.
目次
Colourful linear programming.- Test sets and inequalities for integer programs.- An optimal, stable continued fraction algorithm for arbitrary dimension.- Algorithms and extended formulations for one and two facility network design.- Integer multicommodity flow problems.- A heuristic algorithm for the set covering problem.- An ?-Relaxation method for generalized separable convex cost network flow problems.- Finding real-valued single-source shortest paths in o(n 3) expected time.- A network-flow technique for finding low-weight bounded-degree spanning trees.- Approximating k-set cover and complementary graph coloring.- On minimum 3-cuts and approximating k-cuts using Cut Trees.- Primal-dual approximation algorithms for feedback problems in planar graphs.- Cone-LP's and semidefinite programs: Geometry and a simplex-type method.- Quadratic knapsack relaxations using cutting planes and semidefinite programming.- A semidefinite bound for mixing rates of Markov chains.- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases.- On optimizing multiplications of sparse matrices.- Continuous relaxations for Constrained Maximum-Entropy Sampling.- A submodular optimization problem with side constraints.- Convexity and Steinitz's exchange property.- On ideal clutters, metrics and multiflows.- A supermodular relaxation for scheduling with release dates.- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds.- Implementation of a linear time algorithm for certain generalized traveling salesman problems.- On dependent randomized rounding algorithms.- Coloring bipartite hypergraphs.- Improved randomized approximation algorithms for lot-sizing problems.- Minimizing total completion time in a two-machine flowshop: Analysis of special cases.- A new approach to computing optimal schedules for the job-shop scheduling problem.- Optimal on-line algorithms for single-machine scheduling.- The strongest facets of the acyclic subgraph polytope are unknown.- Transitive packing.- A polyhedral approach to the feedback vertex set problem.- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time.- Separating maximally violated comb inequalities in planar graphs.- The travelling salesman and the PQ-tree.
「Nielsen BookData」 より