Page 1
Page 1
Information Processing in Medical Imaging ; 20th International Conference, IPMI 2007, Kerkrade, The Netherlands, July 2-6, 2007, Proceedings
The 20th International Conference on Information Processing in Medical Im- ing(IPMI)washeldduringJuly2–6,2007,atRolducAbbey,locatedinKerkrade in the south of the Netherlands. IPMI is one of the longest running conferences in medical imaging.
Handbook on Modelling for Discrete Optimization
This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment outlining the state-of-the-art for researchers across the domains of the Computer Science, Math Programming, Applied Mathematics, Engineering, and Operations Research. Included in the handbook's treatment are results from Graph Theory, Logic, Computer Science, and Combinatorics.
Generalized Convexity, Generalized Monotonicity and Applications ; Proceedings of the 7th International Symposium on Generalized Convexity and Generalized Monotonicity
This volume contains a collection of refereed articles on generalized convexity and generalized monotonicity. The first part of the book contains invited papers with applications of (generalized) convexity to such diverse fields as algebraic dynamics of the Gamma function values, discrete optimization, Lipschitzian stability of parametric constraint systems, and monotonicity of functions. The second part contains contributions presenting the latest developments in generalized convexity and generalized monotonicity: its connections with discrete and with continuous optimization, multiobjective optimization, fractional programming, nonsmooth Aanalysis, variational inequalities, and its applications to concrete problems such as finding equilibrium prices in mathematical economics, or hydrothermal scheduling.
Dynamic Programming : A Computational Tool
This book provides a practical introduction to computationally solving discrete optimization problems using dynamic programming. From the unusually numerous and varied examples presented, readers should more easily be able to formulate dynamic programming solutions to their own problems of interest. We also provide and describe the design, implementation, and use of a software tool, named DP2PN2Solver, that has been used to numerically solve all of the problems presented earlier in the book. This computational tool can be used by students to solve academic problems if this book is used in coursework, and by practitioners to solve many real-world problems if the state space is not too large.
Discrete Optimization with Interval Data : Minmax Regret and Fuzzy Approach
This book is a valuable source of information for all operations research practitioners who are interested in modern approaches to problem solving. Apart from the description of the theoretical framework, it also presents some algorithms that can be applied to solve problems that arise in practice.
Complex Scheduling
This book deals with such complex scheduling problems and methods to solve them. It consists of three parts: The ?rst part (Chapters 1 and 2) contains a description of basic scheduling models with applications and an introduction into discrete optimization (covering complexity, shortest path algorithms, linear programming, network ?ow algorithms and general optimization methods). In the second part (Chapter 3) resource-constrained project scheduling problems are considered. Especially, methods like constraint propagation, branch-a- bound algorithms and heuristic procedures are described. Furthermore, lower bounds and general objective functions are discussed.
Algorithms and Complexity ; 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
