國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

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

切換: 標籤 | MARC模式 | ISBD

Integer programming and combinatoria...

(1998 :)

Integer programming and combinatorial optimization20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Integer programming and combinatorial optimizationedited by Andrea Lodi, Viswanath Nagarajan.
其他題名:	20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019 : proceedings /
其他題名:	IPCO 2019
其他作者:	Lodi, Andrea.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xi, 454 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Integer programmingCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-17953-3
ISBN:	9783030179533$q(electronic bk.)

Integer programming and combinatorial optimization20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019 : proceedings /
Integer programming and combinatorial optimization20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019 : proceedings /[electronic resource] :IPCO 2019edited by Andrea Lodi, Viswanath Nagarajan. - Cham :Springer International Publishing :2019. - xi, 454 p. :ill., digital ;24 cm. - Lecture notes in computer science,114800302-9743 ;. - Lecture notes in computer science ;4891..

Identically Self-Blocking Clutters -- Min-Max Correlation Clustering via -- Strong Mixed-Integer Programming Formulations for Trained Neural -- Extended Formulations from Communication Protocols in Output-Efficient -- Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry -- Intersection Cuts for Polynomial Optimization -- Fixed-Order Scheduling on Parallel Machines -- Online Submodular Maximization: Beating 1/2 Made Simple -- Improving the Integrality Gap for Multiway Cut -- nell 1-sparsity Approximation Bounds for Packing Integer Programs -- A General Framework for Handling Commitment in Online Throughput Maximization -- Lower Bounds and A New Exact Approach for the Bilevel Knapsack with Interdiction Constraints -- On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule -- Tight Approximation Ratio for Minimum Maximal Matching -- Integer Programming and Incidence Treedepth -- A Bundle Approach for SDPs with Exact Subgraph Constraints -- Dynamic Flows with Adaptive Route Choice -- The Markovian Price of Information -- On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem -- On Compact Representations of Voronoi Cells of Lattices -- An Efficient Characterization of Submodular Spanning Tree Games -- The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio -- Approximate Multi-Matroid Intersection via Iterative Refinement -- An Exact Algorithm for Robust Influence Maximization -- A New Contraction Technique with Applications to Congruency-Constrained Cuts -- Sparsity of Integer Solutions in the Average Case -- A Generic Exact Solver for Vehicle Routing and Related Problems -- Earliest Arrival Transshipments in Networks With Multiple Sinks -- Intersection Cuts for Factorable MINLP -- Linear Programming Using Limited-Precision Oracles -- Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time -- Breaking Symmetries to Rescue SoS: The Case of Makespan Scheduling -- Random Projections for Quadratic Programs over a Euclidean Ball.

This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 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: 9783030179533$q(electronic bk.)

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

455432
Integer programming
--Congresses.

LC Class. No.: T57.74

Dewey Class. No.: 519.77

Integer programming and combinatorial optimization20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019 : proceedings /
LDR:03848nmm a2200361 a 4500 001 556722
003 DE-He213
005 20190417205838.0
006 m d
007 cr nn 008maaau
008 191127s2019 gw s 0 eng d
020 $a 9783030179533$q(electronic bk.)
020 $a 9783030179526$q(paper)
024 7 $a 10.1007/978-3-030-17953-3 $2 doi
035 $a 978-3-030-17953-3
040 $a GP $c GP
041 0 $a eng
050 4 $a T57.74
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 519.77 $2 23
090 $a T57.74 $b .C748 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Integer programming and combinatorial optimization $h [electronic resource] : $b 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019 : proceedings / $c edited by Andrea Lodi, Viswanath Nagarajan.
246 3 $a IPCO 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xi, 454 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11480
490 1 $a Theoretical computer science and general issues
505 0 $a Identically Self-Blocking Clutters -- Min-Max Correlation Clustering via -- Strong Mixed-Integer Programming Formulations for Trained Neural -- Extended Formulations from Communication Protocols in Output-Efficient -- Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry -- Intersection Cuts for Polynomial Optimization -- Fixed-Order Scheduling on Parallel Machines -- Online Submodular Maximization: Beating 1/2 Made Simple -- Improving the Integrality Gap for Multiway Cut -- nell 1-sparsity Approximation Bounds for Packing Integer Programs -- A General Framework for Handling Commitment in Online Throughput Maximization -- Lower Bounds and A New Exact Approach for the Bilevel Knapsack with Interdiction Constraints -- On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule -- Tight Approximation Ratio for Minimum Maximal Matching -- Integer Programming and Incidence Treedepth -- A Bundle Approach for SDPs with Exact Subgraph Constraints -- Dynamic Flows with Adaptive Route Choice -- The Markovian Price of Information -- On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem -- On Compact Representations of Voronoi Cells of Lattices -- An Efficient Characterization of Submodular Spanning Tree Games -- The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio -- Approximate Multi-Matroid Intersection via Iterative Refinement -- An Exact Algorithm for Robust Influence Maximization -- A New Contraction Technique with Applications to Congruency-Constrained Cuts -- Sparsity of Integer Solutions in the Average Case -- A Generic Exact Solver for Vehicle Routing and Related Problems -- Earliest Arrival Transshipments in Networks With Multiple Sinks -- Intersection Cuts for Factorable MINLP -- Linear Programming Using Limited-Precision Oracles -- Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time -- Breaking Symmetries to Rescue SoS: The Case of Makespan Scheduling -- Random Projections for Quadratic Programs over a Euclidean Ball.
520 $a This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 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 Numeric Computing. $3 275524
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Arithmetic and Logic Structures. $3 276274
700 1 $a Lodi, Andrea. $3 470316
700 1 $a Nagarajan, Viswanath. $3 838970
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-17953-3
950 $a Computer Science (Springer-11645)