{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":52,"n_cols":5,"rows_kept":52,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[19,2,19,3],[20,2,20,3],[23,2,23,3],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[31,2,31,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[39,2,39,3],[40,2,40,3],[44,2,44,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465616503316"]
[null,null,"Titolo",null,"Integer Programming and Combinatorial Optimization [[electronic resource] ] : 5th International IPCO Conference Vancouver, British Columbia, Canada June 3–5, 1996 Proceedings / / edited by William H. Cunningham, S. Thomas McCormick, Maurice Queyranne"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996"]
[null,null,"ISBN",null,"3-540-68453-0"]
[null,null,"Edizione",null,"[1st ed. 1996.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 514 p. 18 illus.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 1084"]
[null,null,"Disciplina",null,"519.7/7"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Probabilities"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Calculus of variations"]
[{"$nulls":4},"Combinatorics"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Probability Theory and Stochastic Processes"]
[{"$nulls":4},"Software Engineering/Programming and Operating Systems"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Calculus of Variations and Optimal Control; Optimization"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Colourful linear programming -- Test sets and inequalities for integer programs -- An optimal, stable continued fraction algorithm for arbitrary dimension -- Algorithms and extended formulations for one and two facility network design -- Integer multicommodity flow problems -- A heuristic algorithm for the set covering problem -- An ?-Relaxation method for generalized separable convex cost network flow problems -- Finding real-valued single-source shortest paths in o(n 3) expected time -- A network-flow technique for finding low-weight bounded-degree spanning trees -- Approximating k-set cover and complementary graph coloring -- On minimum 3-cuts and approximating k-cuts using Cut Trees -- Primal-dual approximation algorithms for feedback problems in planar graphs -- Cone-LP's and "]
[{"$nulls":4},"semidefinite programs: Geometry and a simplex-type method -- Quadratic knapsack relaxations using cutting planes and semidefinite programming -- A semidefinite bound for mixing rates of Markov chains -- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases -- On optimizing multiplications of sparse matrices -- Continuous relaxations for Constrained Maximum-Entropy Sampling -- A submodular optimization problem with side constraints -- Convexity and Steinitz's exchange property -- On ideal clutters, metrics and multiflows -- A supermodular relaxation for scheduling with release dates -- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds -- Implementation of a linear time algorithm for certain generalized traveling salesman problems -- On dependent randomized rounding algorithms -- Coloring bipartite hypergraphs -- Improved randomized approximation algorithms for lot-sizing problems -- Minimizing total completion time in a two-machine flowshop: Analysis of special cases -- A new approach to computing optimal schedules for the job-shop scheduling problem -- Optimal on-line algorithms for single-machine scheduling -- The strongest facets of the acyclic subgraph polytope are unknown -- Transitive packing -- A polyhedral approach to the feedback vertex set problem -- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time -- Separating maximally violated comb inequalities in planar graphs -- The travelling salesman and the PQ-tree."]
[null,null,null,"Sommario/riassunto","This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem."]
[null,"2.","Record Nr.",null,"UNINA9910140487803321"]
[null,null,"Autore",null,"Biech Elaine"]
[null,null,"Titolo",null,"101 ways to make learning active beyond the classroom / / Elaine Biech"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, New Jersey : , : Pfeiffer, , 2015"]
[{"$nulls":4},"©2015"]
[null,null,"ISBN",null,"1-118-97199-X"]
[{"$nulls":4},"1-118-97198-1"]
[null,null,"Edizione",null,"[1st edition]"]
[null,null,"Descrizione fisica",null,"1 online resource (323 p.)"]
[null,null,"Collana",null,"Active Training Series"]
[null,null,"Classificazione",null,"BUS066000"]
[null,null,"Disciplina",null,"658.3/124"]
[null,null,"Soggetti",null,"Occupational training"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Cover; Title Page; Copyright; Contents; Acknowledgments; Introduction: Getting the Most from This Resource; 200 Tips to Make Training Active and Learning Successful; Top 10 Lists; 1. 10 Tips for Successfully Implementing a Virtual Learning Pla; 2. 10 Ideas to Create a Prewebinar Checklist; 3. 10 Slides to Organize Your Virtual Learning; 4. 10 Tips for Opening an Interactive Online Training Session; 5. 10 Webinar Warm-Ups; 6. 10 Ways to Engage Virtual Learners; 7. 10 Tips for Using Annotation Tools; 8. 10 Tips for Using Breakout Rooms in a Virtual Classroom"]
[{"$nulls":4},"9. 10 Tips for Using QR Codes in Learning 10. 10 Polling Tips for Virtual Classrooms; 11. 10 Phrases to Regain Virtual Participants' Attention; 12. 10 Tips for Using Twitter for Ongoing Learning; 13. 10 Tips to Get Started with Games and Gamification; 14. 10 Ways to Use Social Media Tools to Support Learning; 15. 10 Tips to Be Successful with m-Learning; 16. 10 Tips for Shooting a Video; 17. 10 Tips for Virtual Coaching; 18. 10 Tips for Virtual Teamwork; 19. 10 Tips for Leaders as Teachers; 20. 10 Tips and Options for Training in Virtual Reality Environments; Online Learning; Online Openings"]
[{"$nulls":4},"1. Picture Me 2. You Intro Me;  I Intro You; 3. Quote Me; 4. Using Prezi to Build Community in the Virtual Classroom; 5. Instagram Intros; Online Closings; 6. Review, Remember, Relate, Recall; 7. Make Them Stick; 8. Choose and Choose Again; 9. Concept Challenge; Online Learning Activities; 10. Using Analogies; 11. Virtual Learning by Quadrants; 12. Incorporate MOOC (massive open online course) Design Concepts into Your Online Design; 13. Small-Group Data Analysis; 14. "]
[{"$nulls":4},"Social Media Sharing about Implicit Bias; 15. Think-Pair-Share for Webinars; Online Asynchronous Learning"]
[{"$nulls":4},"16. Creating a Culture Dream Team 17. Point-Counterpoint; 18. On boarding New Employees; Unique Online Situations; 19. Corporate Global Survey; 20. Find It; 21. Facilitating from Afar; Technology Tactics; Blended Solutions; 22. Move to the Goal; 23. Do-It-Yourself (DIY) Job Aid; 24. The 411; 25. Gear Up Your Brain; e-Learning Tools; 26. Increase Interaction Using a Whiteboard; 27. Meter Poll; 28. Engaging Course Map for an e-Learning Course; 29. Google Hangout Collaborations; 30. Pinboard Key Learning; 31. Poll for Impact!; 32. Show Me; m-Learning; 33. Mobile Debates; 34. Survey in Hand"]
[{"$nulls":4},"35. Picture This 36. Take My Speech Home; 37. Tweet a Learning Needs Assessment; 38. Just-in-Time Reminder; Social Learning; 39. Social Learning Gone Wild Participating in a LinkedIn Group; 40. Digital Round Robin; 41. Blog-Based Skills Inventory; 42. Social Media Opinion Polling; 43. The #1 Thing; 44. Office Hours; 45. Quiz Challenge; Technology in the Classroom; 46. Twitter Engagement; 47. QR Code Search; 48. Pause and Discover; Learning from Many; Learning on a Team; 49. I Felt Valued; 50. Teamwork in History; 51. Build a Trusting Team; 52. Feedback for the Team; 53. MVP Award"]
[{"$nulls":4},"My Mentor and Me"]
[null,null,null,"Sommario/riassunto","Fresh, creative strategies guaranteed to enliven online training  101 Ways to Make Learning Active Beyond the Classroom provides proven, practical strategies, activities, and tips for those tasked with facilitating training in any subject area among alternative settings. Based on the best-selling Active Training approach, these methods have been designed by recognized experts, and are guaranteed to enliven any learning event. Readers will find a toolkit of ready-to-use exercises and tips for organizing, conducting, and delivering active learning, in alternative settings on the job or around"]