"Solving Network Design Problems via Decomposition, Aggregation and Approximation"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Solving Network Design Problems via Decomposition, Aggregation and Approximation	Andreas Bärmann	1st ed. 2016	Springer Fachmedien Wiesbaden
Solution of large-scale multicommodity network flow problems via a logarithmic barrier function decomposition	Heinrich Lange	1988	Naval Postgraduate School
Productivity: Concepts, Measurement, Aggregation, and Decomposition	Bert M. Balk	1st ed. 2021	Springer International Publishing
Solving Frontier Problems of Physics: The Decomposition Method	G. Adomian	1994	Springer Netherlands
Theory of suboptimal decisions: decomposition and aggregation	A. A. Pervozvanskiĭ	1988	Kluwer Academic Publishers
Theory of Suboptimal Decisions: Decomposition and Aggregation	A. A. Pervozvanskii; V. G. Gaitsgori	1988	Springer Netherlands
Hodge Decomposition - A Method for Solving Boundary Value Problems	Günter Schwarz	1995	Springer Berlin Heidelberg
Solving Critical Design Problems: Theory and Practice	Tania Allen	2019	Routledge
Solving plant problems: design, operations, maintenance	William O'Keefe; Thomas C. Elliott	1984	McGraw-Hill
Generalized Network Design Problems: Modeling and Optimization	Petrica C. Pop	2012	De Gruyter
Solving Mechanical Design Problems with Computer Graphics	Jerome C. Lange	1986	Routledge
Solving parametric design problems requiring configuration choices	Rajan Ramaswamy	1991	Sloan School of Management, Massachusetts Institute of Technology
Solving problems	George Willard Frasier	1955	L.W. Singer Co.
Solving problems	Christine Finochio	2002	Nelson Thomson Learning
Stability, Approximation, and Decomposition in Two- and Multistage Stochastic Programming	Christian Küchler	2009	Vieweg+Teubner Verlag
The Analytic Hierarchy and Network Processes: Application in Solving Multicriteria Decision Problems	Wiktor Adamus	2009-12	Jagiellonian University Press
Constructive Approximation: Advanced Problems	George G. Lorentz, Manfred v. Golitschek, Yuly Makovoz	2011	Springer
Constructive approximation: advanced problems /	Lorentz, G. G.; Golitschek, Manfred von,; Makovoz, Yuly,	[1996], ©1996.	Springer,
Game Theoretic Problems in Network Economics and Mechanism Design Solutions	Y. Narahari; Dinesh Garg; Ramasuri Narayanam; Hastagiri Prakash	2009	Springer London
Approximation Problems in Analysis and Probability	M.P. Heble	1989	North-Holland
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Solving Network Problems		Oracle 8i Design Tuning
Aggregation and Decomposition		Apple - Inside Cocoa- Object-Oriented Programming And The Objective-C Language	editors	2000	Apple Computor Inc./
Aggregation and Decomposition		The Objective-C Programming Language - Inside Mac OS X		2003	Apple
Decomposition and Aggregation		Handbook of Production Economics	Subhash C. Ray (editor), Robert G. Chambers (editor), Subal C. Kumbhakar (editor)	2022	Springer
Solving Design Problems	Ramana M. Pidaparti	Design Engineering Journey	Ramana Pidaparti		Springer International Publishing
Solving Design Problems	Pekka J. Korhonen; Jyrki Wallenius	Making Better Decisions: Balancing Conflicting Criteria	Pekka J. Korhonen; Jyrki Wallenius	1st ed. 2020	Springer International Publishing
Iterative Aggregation-Decomposition in Optimization Problems	Igor Litvinchev; Vladimir Tsurkov	Aggregation in Large-Scale Optimization	I. Litvinchev; Vladimir Tsurkov	2003	Springer US
Approximation Algorithms for Multi-budgeted Network Design Problems	Georgios Stamoulis	Structural Information and Communication Complexity: 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings	Christian Scheideler	1st ed. 2015	Springer International Publishing
Network Design Problems	Bernhard Korte; Jens Vygen	Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	2000	Springer Berlin Heidelberg
Network Design Problems	Bernhard Korte; Jens Vygen	Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	5th ed. 2012	Springer Berlin Heidelberg
Network Design Problems		Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	3rd ed. 2006	Springer Berlin Heidelberg
Network Design Problems		Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	4th ed. 2008	Springer Berlin Heidelberg
Network Design Problems	Bernhard Korte; Jens Vygen	Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	2nd ed. 2002	Springer Berlin Heidelberg
Network Design Problems	Dietmar Cieslik	Encyclopedia of Optimization	Christodoulos A. Floudas; Panos M. Pardalos	2001	Springer US
Network Design Problems		Shortest Connectivity: An Introduction with Applications in Phylogeny	Dietmar Cieslik	2005	Springer US
Network Design Problems	Dietmar Cieslik	Encyclopedia of Optimization	Christodoulos A. Floudas; Panos M. Pardalos	2nd ed. 2009	Springer US
Network Design Problems		Reference Encyclopedia of Optimization		2009	Springer
Network Design Problems	Bernhard Korte; Jens Vygen	Combinatorial Optimization: Theory and Algorithms	Bernhard Korte; Jens Vygen	6th ed. 2018	Springer Berlin Heidelberg
Aggregation, Decomposition, and Equivalence	Yu-Chi Ho; Xi-Ren Cao	Perturbation Analysis of Discrete Event Dynamic Systems	Yu-Chi Ho; Xi-Ren Cao	1991	Springer US
Hardness of Approximation for Vertex-Connectivity Network-Design Problems	Guy Kortsarz; Robert Krauthgamer; James R. Lee	Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings	Klaus Jansen; Stefano Leonardi; Vijay Vazirani	2002	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Solving Network Design Problems via Decomposition, Aggregation and Approximation" - similar Books and Chapters