"An Online Algorithm for the Postman Problem with a Small Penalty"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
An algorithm for the traveling salesman problem	John D. C. Little	1963	M.I.T.
An algorithm for generating ship schedules for a crisis deployment problem	Svein Buvik	1988
An algorithm for solving a range constrained traveling salesman problem	John William Harms	1976	Naval Postgraduate School
A branch and exclude algorithm for the knapsack problem	Robert Lawrence Hegerich	1968	Naval Postgraduate School;Available from National Technical Information Service
An algorithm for the symmetric generalized eigenvalue problem Ax = [delta]Bx	Chang-chung Chang	1974	Center for Advanced Computation, University of Illinois at Urbana - Champaign
A composite algorithm for the concave-cost LTL consolidation problem	Anantaram Balakrishnan	1985	Massachusetts Institute of Technology, Alfred P. Sloan School of Management
A branch and bound algorithm for the delivery truck problem	Stephen John Balut	1973	Naval Postgraduate School
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
A geometric algorithm for solving the general linear programming problem.	James Thurber	1958	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the maximal planar subgraph problem.	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
An O(n log n) algorithm for the maximal planar subgraph problem	Jiazhen Cai	1992	Courant Institute of Mathematical Sciences, New York University
A small problem	A. R. Plumb	1995	Disney Press
Conditions under which a penalty function algorithm is well defined	James K. Hartman	1973	Naval Postgraduate School
Online marketing for small businesses	Doherty, Julia (Writer on marketing)	2015	In Easy Steps Limited
Postman Pat Time for a Treat (Postman Pat)	John Cunliffe	June 14, 2001	Hodder Children's Books
Tell the Time with Postman Pat (Postman Pat)	Alison Green; Arkadia	June 13, 1994	Egmont Childrens Books
Requiem for a postman	Margaret L. Press	1992	Carroll & Graf Publishers
Online Algorithms for the Portfolio Selection Problem	Robert Dochow	1st ed. 2016	Springer Fachmedien Wiesbaden
A graph coloring algorithm and a scheduling problem	Robert Albert Draper	1971	U.S. Naval Postgraduate School
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
An Online Algorithm for the Postman Problem with a Small Penalty	Piotr Berman; Junichiro Fukuyama	Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001	Michel Goemans; Klaus Jansen; Jose D.P. Rolim; Luca Trevisan	2001	Springer Berlin Heidelberg
An algorithm for the Rural Postman problem on a directed graph	Nicos Christofides; V. Campos; A. Corberán; E. Mota	Netflow at Pisa	Giorgio Gallo; C. Sandi	1986	Springer Berlin Heidelberg
An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem	Jianping Li; Lijian Cai; Junran Lichen; Pengxiang Pan; Wencheng Wang; Suding Liu	Algorithmic Aspects in Information and Management: 15th International Conference, AAIM 2021, Virtual Event, December 20–22, 2021, Proceedings	Weili Wu; Hongwei Du	1st ed. 2021	Springer International Publishing
Genetic Algorithm for Mixed Chinese Postman Problem	Hua Jiang; Lishan Kang; Shuqi Zhang; Fei Zhu	Advances in Computation and Intelligence: 5th International Symposium, ISICA 2010, Wuhan, China, October 22-24, 2010, Proceedings	Zhihua Cai; Chengyu Hu; Zhuo Kang; Yong Liu	2010	Springer Berlin Heidelberg
The Postman Problem	Loo-Keng Hua; Yuan Wang; J. G. C. Heijmans	Popularizing Mathematical Methods in the People’s Republic of China: Some Personal Experiences	L.K. Hua; Wang	1989	Birkhäuser Boston
Training Pi-Sigma Network by Online Gradient Algorithm with Penalty for Small Weight Update			MIT Press	2007	MIT Press
An optimal method for the mixed postman problem	N. Christofides; E. Benavent; V. Campos; A. Corberán; E. Mota	System Modelling and Optimization: Proceedings of the 11th IFIP Conference Copenhagen, Denmark, July 25–29, 1983	P. Thoft-Christensen	1984	Springer Berlin Heidelberg
A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory	Sung-Pil Hong	Computing and Combinatorics: 5th Annual International Conference, COCOON' 99, Tokyo, Japan, July 26-28, 1999, Proceedings	Takao Asano; Hiroshi Imai; D.T. Lee; Shin-ichi Nakano; Takeshi Tokuyama	1999	Springer Berlin Heidelberg
An Online Algorithm for Online Fraud Detection	Fabrizio Malfanti; Delio Panaro; Eva Riccomagno	Adaptive Mobile Computing	Mauro Migliardi; Alessio Merlo; Sherenaz Al-Haj Baddar; Mauro Migliardi; Alessio Merlo; Sherenaz Al-Haj Baddar	2017	Academic Press
Penalty Algorithm		MATLAB Global Optimization Toolbox™ User's Guide	The MathWorks, Inc.	2020	The MathWorks, Inc.
A problem with the algorithm		Distributed Computing: Principles, Algorithms, and Systems	Ajay D. Kshemkalyani, Mukesh Singhal	2008	Cambridge University Press
A Deterministic Online Algorithm for the List-Update Problem	Hiranjyoti Mahanta; Phalguni Gupta	High Performance Computing - HiPC' 99: 6th International Conference, Calcutta, India, December 17-20, 1999 Proceedings	Prith Banerjee; Viktor K. Prasanna; Bhabani P. Sinha	1999	Springer Berlin Heidelberg
A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem	Jinghao Sun; Yakun Meng; Guozhen Tan	Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013, Proceedings	Michael Fellows; Xuehou Tan; Binhai Zhu	2013	Springer Berlin Heidelberg
The Chinese Postman Problem	Rainer E. Burkard; Ulrich Derigs	Assignment and Matching Problems: Solution Methods with FORTRAN-Programs	R. E. Burkard; U. Derigs	1980	Springer Berlin Heidelberg
The Chinese postman problem		Nets, puzzles, and postmen	Higgins, Peter M	2007	Oxford University Press
The Chinese postman problem		Graph Theory and Complex Networks: An Introduction	Maarten van Steen	2010	Maarten van Steen
The Chinese Postman Problem		Nets, Puzzles and Postmen: An Exploration of Mathematical Connections	Peter M Higgins	2008	Oxford University Press
Chinese Postman Problem	William R. Stewart Jr.	Encyclopedia of Operations Research and Management Science	Saul I. Gass; Michael C. Fu	3rd ed. 2013	Springer US
Chinese postman problem	William R. Stewart Jr.	Encyclopedia of Operations Research and Management Science	Saul I. Gass; Carl M. Harris	2nd ed. 2001	Springer US
Chinese Postman Problem		The Concise Oxford Dictionary of Mathematics (Oxford Quick Reference)	Richard Earl, James Nicholson	2021	Oxford University Press
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"An Online Algorithm for the Postman Problem with a Small Penalty" - similar Books and Chapters