| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466200403316 |
|
|
Titolo |
Integer Programming and Combinatorial Optimization [[electronic resource] ] : 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings / / edited by Andrea Lodi, Viswanath Nagarajan |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2019.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XI, 454 p. 313 illus., 20 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11480 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Numerical analysis |
Computer science—Mathematics |
Discrete mathematics |
Algorithms |
Artificial intelligence—Data processing |
Computer arithmetic and logic units |
Numerical Analysis |
Discrete Mathematics in Computer Science |
Data Science |
Arithmetic and Logic Structures |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910784208203321 |
|
|
Titolo |
The new books kids like [[electronic resource] /] / edited by Sharon Deeds, Catherine Chastain ; prepared for Association for Library Service to Children |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Chicago, : American Library Association, 2001 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (191 p.) |
|
|
|
|
|
|
Altri autori (Persone) |
|
DeedsSharon |
ChastainCatherine |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Children - Books and reading - United States |
Children's literature |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical reference index. |
|
|
|
|
|
|
Nota di contenuto |
|
Contents; Preface; Acknowledgments; Chapter 1: Where Are Your Funny Books? (Picture Books and Beginning Readers); Chapter 2: Where Are Your Funny Chapter Books?; Chapter 3: Where Are Your Poetry Books?; Chapter 4: Where Are Your Fairy Tales? (Picture Books); Chapter 5: Where Are Your Fairy Tales? (Chapter Books); Chapter 6: Do You Have Any Other Books Like The True Story of the Three Little Pigs? (Fractured Fairy Tales); Chapter 7: I Want to Read a Folktale, Legend,Myth, or Tall Tale; Chapter 8: Where Are Your Science Fiction Books?; Chapter 9: What Are Some Good Fantasy Books? |
Chapter 10: What Are Some Good Fantasy Books? (Time Travel)Chapter 11: I Want to Read an Adventure Story; Chapter 12: I Want to Read a Book about Kids Who Are Brave; Chapter 13: Where Are Your Survival Stories?; Chapter 14: Do You Have Any Books about Sports?; Chapter 15: Do You Have Any Mystery Books?; Chapter 16: Where Are Your "I Spy" or Other Search-and-Solve Books?; Chapter 17: Do You Have Any Really Scary Books?; Chapter |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
With this handy new reference, you'll be equipped to answer questions for young people who know exactly what they want as well as for those who have no idea but just know that they want something ''good.'' Seasoned librarians Deeds and Chastain surveyed children's librarians from around the country, bringing together the wisdom and |
|
|
|
|
|
|
|
|
|
|
experiences of librarians from both school and public library settings for one collection of expert picks. Organized around 44 topics considered by the panel to be ''the most frequently requested,'' the end result is chock full of more than 500 annotated book recomm |
|
|
|
|
|
| |