Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Operations research or analysis
Reexamination Certificate
2003-10-31
2009-08-18
Sterrett, Jonathan G (Department: 3623)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Operations research or analysis
Reexamination Certificate
active
07577576
ABSTRACT:
A method for placing branch locations having the steps of: (a) identifying at least one service provider branch location, (b) identifying at least one service receiver, (c) identifying a measure of service receiver value, (d) calculating the value of each of the service receivers based on the measure of service receiver value, (e) determining which of the service provider branch locations is the closest service provider branch location for each of the service receivers, and (f) determining a probability that each of the service receivers will utilize the closest service provider branch location.
REFERENCES:
patent: 4935877 (1990-06-01), Koza
patent: 5319781 (1994-06-01), Syswerda
patent: 5343388 (1994-08-01), Wedelin
patent: 5504887 (1996-04-01), Malhotra et al.
patent: 5541848 (1996-07-01), McCormack et al.
patent: 5546542 (1996-08-01), Cosares et al.
patent: 5848403 (1998-12-01), Gabriner et al.
patent: 5897629 (1999-04-01), Shinagawa et al.
patent: 5940816 (1999-08-01), Fuhrer et al.
patent: 6092065 (2000-07-01), Floratos et al.
patent: 6282527 (2001-08-01), Gounares et al.
patent: 6363368 (2002-03-01), Shinagawa
patent: 6470301 (2002-10-01), Barral
patent: 6526373 (2003-02-01), Barral
patent: 6578005 (2003-06-01), Lesaint
patent: 2002/0188489 (2002-12-01), Cheng et al.
patent: 2003/0099014 (2003-05-01), Egner et al.
Shmoys, et. Al, “Approximation algorithms for facility location problems”, 1997, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, El Paso, Texas, United States,pp. 265-274(1-21).
Mahdian, et al, “A Greedy Facility Location Algorithm Analyzed Using Dual Fitting”, Lecture Notes In Computer Science; vol. 2129, 2001, Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, ISBN:3-540-42470-9.
AB Hadj-Alouane, JC Bean; “A Genetic Algorithm for the Multiple-Choice Integer Program”- Operations Research, 1997—JSTOR.
LandOfFree
Network branch placement tool does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Network branch placement tool, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network branch placement tool will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4098067