| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910456913703321 |
|
|
Autore |
Schachter-Shalomi Zalman <1924-> |
|
|
Titolo |
A heart afire [[electronic resource] ] : stories and teachings of the early Hasidic masters / / translated and retold with commentary by Zalman Schachter-Shalomi and Netanel Miles-Yepez ; with a foreword by Arthur Green |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Philadelphia, : Jewish Publication Society, 2009 |
|
|
|
|
|
|
|
ISBN |
|
1-283-80576-6 |
0-8276-0984-1 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (434 p.) |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Hasidim |
Rabbis |
Jewish legends |
Hasidism - History |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. 383-390) and index. |
|
|
|
|
|
|
Nota di contenuto |
|
The hidden tradition and the Ba'al Shem Tov -- The circle of the Ba'al Shem and the Maggid of Mezritch -- The circle of the Maggid and the rebbe king. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
The interpretations in A Heart Afire are as rich and meaningful as the teachings and tales themselves in this intimate guided tour of Hasidism and Hasidic storytelling led by Reb Zalman, an old-world Hasidic elder who is also profoundly connected to modern culture. As a bridge between both worlds, Reb Zalman, and his co-author and student Netanel Miles-Yepez, introduce the reader to rare and unique translations of Hasidism with their own personal reflections on their meaning. This book gives the readers the opportunity to immerse themselves in the world of Hasidic wisdom and narrative |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910144168403321 |
|
|
Titolo |
Integer Programming and Combinatorial Optimization : 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings / / edited by George Nemhauser, Daniel Bienstock |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2004.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 448 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 3064 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Probabilities |
Applied mathematics |
Engineering mathematics |
Computers |
Numerical analysis |
Algorithms |
Computer science—Mathematics |
Probability Theory and Stochastic Processes |
Applications of Mathematics |
Theory of Computation |
Numeric Computing |
Algorithm Analysis and Problem Complexity |
Discrete Mathematics in Computer Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Session 1 -- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem -- Metric Inequalities and the Network Loading Problem -- Valid Inequalities Based on Simple Mixed-Integer Sets -- Session 2 -- The Price of Anarchy when Costs Are Non-separable and Asymmetric -- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem -- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games -- |
|
|
|
|
|
|
|
|
|
|
|
Session 3 -- A Robust Optimization Approach to Supply Chain Management -- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems -- Scheduling an Industrial Production Facility -- Session 4 -- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs -- A TDI Description of Restricted 2-Matching Polytopes -- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems -- Session 5 -- Semi-continuous Cuts for Mixed-Integer Programming -- Combinatorial Benders’ Cuts -- A Faster Exact Separation Algorithm for Blossom Inequalities -- Session 6 -- LP-based Approximation Algorithms for Capacitated Facility Location -- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem -- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization -- Session 7 -- Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions -- The Path-Packing Structure of Graphs -- More on a Binary-Encoded Coloring Formulation -- Session 8 -- Single Machine Scheduling with Precedence Constraints -- The Constrained Minimum Weighted Sum of Job Completion Times Problem -- Session 9 -- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption -- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts -- All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables -- Session 10 -- A Capacity Scaling Algorithm for M-convex Submodular Flow -- Integer Concave Cocirculations and Honeycombs -- Minsquare Factors and Maxfix Covers of Graphs -- Session 11 -- Low-Dimensional Faces of Random 0/1-Polytopes -- On Polyhedra Related to Even Factors -- Optimizing over Semimetric Polytopes. |
|
|
|
|
|
|
Sommario/riassunto |
|
This volume contains the papers accepted for publication at IPCO X, the Tenth International Conference on Integer Programming and Combinatorial Optimization, held in New York City, New York, USA, June 7–11, 2004.The IPCO series of conferences presents recent results in theory, computation and applications of integer programming and combinatorial optimization. These conferences are sponsored by the Mathematical Programming Society, and are held in those years in which no International Symposium on Mathematical Programming takes place. IPCO VIII was held in Utrecht (The Netherlands) and IPCO IX was held in Cambridge (USA). A total of 109 abstracts, mostly of very high quality, were submitted. The Program Committee accepted 32, in order to meet the goal of having three days of talks with no parallel sessions. Thus, many excellent abstracts could not be accepted. The papers in this volume have not been refereed. It is expected that revised versions of the accepted papers will be submitted to standard scientific journals for publication. The Program Committee thanks all authors of submitted manuscripts for their support of IPCO. March 2004 George Nemhauser Daniel Bienstock Organization IPCO X was hosted by the Computational Optimization Research Center (CORC), Columbia University. |
|
|
|
|
|
|
|
| |