國立虎尾科技大學 |

Integer Programming and Combinatorial Optimization = 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Integer Programming and Combinatorial Optimization/ edited by Quentin Louveaux, Martin Skutella.
其他題名:	18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /
其他作者:	Louveaux, Quentin.
面頁冊數:	XIII, 412 p. 33 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Numerical analysis. -
電子資源:	https://doi.org/10.1007/978-3-319-33461-5
ISBN:	9783319334615

Integer Programming and Combinatorial Optimization = 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /
Integer Programming and Combinatorial Optimization18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /[electronic resource] :edited by Quentin Louveaux, Martin Skutella. - 1st ed. 2016. - XIII, 412 p. 33 illus.online resource. - Theoretical Computer Science and General Issues ;9682. - Theoretical Computer Science and General Issues ;9163.

On Approximation Algorithms for Concave Mixed-Integer QuadraticProgramming -- Centerpoints: A link between optimization and convex geometry -- Rescaled coordinate descent methods for Linear Programming -- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems -- Max-Cut under Graph Constraints -- Sparsest cut in planar graphs, maximum concurrent ows and their connections with the max-cut problem -- Intersection Cuts for Bilevel Optimization -- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem -- Extended Formulations in Mixed-integer Convex Programming -- k-Trails: Recognition, Complexity, and Approximations -- Better s-t-Tours by Gao Trees -- Popular Edges and Dominant Matchings -- Semidefinite and linear programming integrality gaps for scheduling identical machines -- Stabilizing network bargaining games by blocking players -- Round Robin Tournaments Generated by the Circle Method have Maximum Carry-Over -- Extreme Functions with an Arbitrary Number of Slopes -- Minimal cut-generating functions are nearly extreme -- On the Mixed Binary Representability of Ellipsoidal Regions -- Constant Factor Approximation for ATSP with Two Edge Weights -- Improved Approximation Algorithms for Hitting 3-Vertex Paths -- Improved Approximations for Cubic Bipartite and Cubic TSP -- An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ϵ capacity violation -- Valid Inequalities for Separable Concave Constraints with Indicator Variables -- A Polyhedral Approach to Online Bipartite Matching -- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank -- Robust Monotone Submodular Function Maximization -- Maximizing Monotone Submodular Functions over the Integer Lattice -- Submodular Unsplittable Flow on Trees -- Strong reductions for extended formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point -- On the quantile cut closure of chance-constrained problems. .

This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 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. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

ISBN: 9783319334615

Standard No.: 10.1007/978-3-319-33461-5doiSubjects--Topical Terms:

527939
Numerical analysis.

LC Class. No.: QA297-299.4

Dewey Class. No.: 518

Integer Programming and Combinatorial Optimization = 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings /
LDR:04472nam a22004095i 4500 001 972894
003 DE-He213
005 20200630092156.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319334615 $9 978-3-319-33461-5
024 7 $a 10.1007/978-3-319-33461-5 $2 doi
035 $a 978-3-319-33461-5
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 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings / $c edited by Quentin Louveaux, Martin Skutella.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XIII, 412 p. 33 illus. $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 9682
505 0 $a On Approximation Algorithms for Concave Mixed-Integer QuadraticProgramming -- Centerpoints: A link between optimization and convex geometry -- Rescaled coordinate descent methods for Linear Programming -- Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems -- Max-Cut under Graph Constraints -- Sparsest cut in planar graphs, maximum concurrent ows and their connections with the max-cut problem -- Intersection Cuts for Bilevel Optimization -- Exact Algorithms for the Chance-Constrained Vehicle Routing Problem -- Extended Formulations in Mixed-integer Convex Programming -- k-Trails: Recognition, Complexity, and Approximations -- Better s-t-Tours by Gao Trees -- Popular Edges and Dominant Matchings -- Semidefinite and linear programming integrality gaps for scheduling identical machines -- Stabilizing network bargaining games by blocking players -- Round Robin Tournaments Generated by the Circle Method have Maximum Carry-Over -- Extreme Functions with an Arbitrary Number of Slopes -- Minimal cut-generating functions are nearly extreme -- On the Mixed Binary Representability of Ellipsoidal Regions -- Constant Factor Approximation for ATSP with Two Edge Weights -- Improved Approximation Algorithms for Hitting 3-Vertex Paths -- Improved Approximations for Cubic Bipartite and Cubic TSP -- An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ϵ capacity violation -- Valid Inequalities for Separable Concave Constraints with Indicator Variables -- A Polyhedral Approach to Online Bipartite Matching -- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank -- Robust Monotone Submodular Function Maximization -- Maximizing Monotone Submodular Functions over the Integer Lattice -- Submodular Unsplittable Flow on Trees -- Strong reductions for extended formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Sum-of-squares lower bounds for maximally symmetric formulations -- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point -- On the quantile cut closure of chance-constrained problems. .
520 $a This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 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. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
650 0 $a Numerical analysis. $3 527939
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer communication systems. $3 1115394
650 1 4 $a Numeric Computing. $3 669943
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Louveaux, Quentin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1108808
700 1 $a Skutella, Martin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678740
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319334608
776 0 8 $i Printed edition: $z 9783319334622
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-33461-5
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)