國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁 到查詢結果 [ subject:"Integer programming" ]

切換: 標籤 | MARC模式 | ISBD

Integer programming and combinatoria...

(1998 :)

Integer programming and combinatorial optimization21st International Conference, IPCO 2020, London, UK, June 8-10, 2020 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Integer programming and combinatorial optimizationedited by Daniel Bienstock, Giacomo Zambelli.
其他題名:	21st International Conference, IPCO 2020, London, UK, June 8-10, 2020 : proceedings /
其他題名:	IPCO 2020
其他作者:	Bienstock, Daniel.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	ix, 450 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Integer programmingCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-45771-6
ISBN:	9783030457716$q(electronic bk.)

Integer programming and combinatorial optimization21st International Conference, IPCO 2020, London, UK, June 8-10, 2020 : proceedings /
Integer programming and combinatorial optimization21st International Conference, IPCO 2020, London, UK, June 8-10, 2020 : proceedings /[electronic resource] :IPCO 2020edited by Daniel Bienstock, Giacomo Zambelli. - Cham :Springer International Publishing :2020. - ix, 450 p. :ill., digital ;24 cm. - Lecture notes in computer science,121250302-9743 ;. - Lecture notes in computer science ;4891..

Idealness of k-wise intersecting families -- Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity -- Faster Algorithms for Parametric Global Minimum Cut Problems -- Optimizing Sparsity over Lattices and Semigroups -- A Technique for Obtaining True Approximations for k-Center with Covering Constraints -- Tight Approximation Bounds for Maximum Multi-Coverage -- Implementing automatic Benders decomposition in a modern MIP solver -- Improved Approximation Algorithms for Inventory Problems -- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles -- On a generalization of the Chv atal-Gomory closure -- Algorithms for ows over time with scheduling costs -- Integer Plane Multi ow Maximisation: Flow-Cut Gap and One-Quarter-Approximation -- Stochastic Makespan Minimization in Structured Set Systems -- Continuous facility location on graphs -- Recognizing even-cycle and even-cut matroids -- A combinatorial algorithm for computing the rank of a generic partitioned matrix with

This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.

ISBN: 9783030457716$q(electronic bk.)

Standard No.: 10.1007/978-3-030-45771-6doiSubjects--Topical Terms:

455432
Integer programming
--Congresses.

LC Class. No.: T57.74 / .C65 2020

Dewey Class. No.: 519.77

Integer programming and combinatorial optimization21st International Conference, IPCO 2020, London, UK, June 8-10, 2020 : proceedings /
LDR:03935nmm a2200373 a 4500 001 571792
003 DE-He213
005 20200413221122.0
006 m d
007 cr nn 008maaau
008 200922s2020 sz s 0 eng d
020 $a 9783030457716$q(electronic bk.)
020 $a 9783030457709$q(paper)
024 7 $a 10.1007/978-3-030-45771-6 $2 doi
035 $a 978-3-030-45771-6
040 $a GP $c GP
041 0 $a eng
050 4 $a T57.74 $b .C65 2020
072 7 $a UYA $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYA $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 519.77 $2 23
090 $a T57.74 $b .C748 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Integer programming and combinatorial optimization $h [electronic resource] : $b 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020 : proceedings / $c edited by Daniel Bienstock, Giacomo Zambelli.
246 3 $a IPCO 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a ix, 450 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12125
490 1 $a Theoretical computer science and general issues
505 0 $a Idealness of k-wise intersecting families -- Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity -- Faster Algorithms for Parametric Global Minimum Cut Problems -- Optimizing Sparsity over Lattices and Semigroups -- A Technique for Obtaining True Approximations for k-Center with Covering Constraints -- Tight Approximation Bounds for Maximum Multi-Coverage -- Implementing automatic Benders decomposition in a modern MIP solver -- Improved Approximation Algorithms for Inventory Problems -- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles -- On a generalization of the Chv atal-Gomory closure -- Algorithms for ows over time with scheduling costs -- Integer Plane Multi ow Maximisation: Flow-Cut Gap and One-Quarter-Approximation -- Stochastic Makespan Minimization in Structured Set Systems -- Continuous facility location on graphs -- Recognizing even-cycle and even-cut matroids -- A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 ntimes 2 $ submatrices -- Fair Colorful k-Center Clustering -- Popular Branchings and Their Dual Certi cates -- Sparse graphs and an augmentation problem -- About the Complexity of Two-Stage Stochastic Ips -- Packing under Convex Quadratic Constraints -- Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles -- Single source unsplittable ows with arc-wise lower and upper bounds -- Maximal quadratic-free sets -- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming -- Andrea Lodi and Felipe Serrano -- The integrality number of an integer program -- Persistency of Linear Programming Relaxations for the Stable Set Problem -- Constructing lattice-free gradient polyhedra in dimension two -- Sequence independent lifting for the set of submodular maximization problem -- A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering -- Graph Coloring Lower Bounds from Decision Diagrams -- On convex hulls of epigraphs of QCQPs -- On the convexi cation of constrained quadratic optimization problems with indicator variables.
520 $a This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.
650 0 $a Integer programming $v Congresses. $3 455432
650 0 $a Combinatorial optimization $v Congresses. $3 441127
650 1 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Information Systems and Communication Service. $3 274025
700 1 $a Bienstock, Daniel. $3 346741
700 1 $a Zambelli, Giacomo. $3 702898
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-45771-6
950 $a Computer Science (Springer-11645)