國立虎尾科技大學 |

Integer Programming and Combinatorial Optimization = 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Integer Programming and Combinatorial Optimization/ edited by Andrea Lodi, Viswanath Nagarajan.
Reminder of title:	20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings /
other author:	Lodi, Andrea.
Description:	XI, 454 p. 313 illus., 20 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Numerical analysis. -
Online resource:	https://doi.org/10.1007/978-3-030-17953-3
ISBN:	9783030179533

Integer Programming and Combinatorial Optimization = 20th 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] :edited by Andrea Lodi, Viswanath Nagarajan. - 1st ed. 2019. - XI, 454 p. 313 illus., 20 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11480. - Theoretical Computer Science and General Issues ;9163.

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

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

527939
Numerical analysis.

LC Class. No.: QA297-299.4

Dewey Class. No.: 518

Integer Programming and Combinatorial Optimization = 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings /
LDR:04133nam a22004095i 4500 001 1014169
003 DE-He213
005 20200704065951.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030179533 $9 978-3-030-17953-3
024 7 $a 10.1007/978-3-030-17953-3 $2 doi
035 $a 978-3-030-17953-3
050 4 $a QA297-299.4
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 518 $2 23
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.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XI, 454 p. 313 illus., 20 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11480
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 Numerical analysis. $3 527939
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 1 4 $a Numeric Computing. $3 669943
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Arithmetic and Logic Structures. $3 672631
700 1 $a Lodi, Andrea. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 680443
700 1 $a Nagarajan, Viswanath. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1225885
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030179526
776 0 8 $i Printed edition: $z 9783030179540
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-17953-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)