{"id":{"repo_id":"buffalo","oai_identifier":"oai:ubir.buffalo.edu:10477/86669"},"canonical_url":"https://search.dev.ndltd.org/etd/buffalo/oai:ubir.buffalo.edu:10477/86669","repository":{"repo_id":"buffalo","name":"Buffalo","base_url":"https://ubir.buffalo.edu/oai/request"},"display":{"title":"Optimization of Online Advertising on Search Engines","abstract":"M.S.","abstract_html":"M.S.","abstract_has_math":false,"creators":["Dayanand, Anjarlekar Sujay"],"institution":"State University of New York at Buffalo","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Zhuang, Jun","Industrial and Systems Engineering"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-02-21T21:36:16Z","date_published":"2025-02-21T21:36:16Z","updated_at":"2026-07-27T19:05:34Z","subjects":["operations research"],"languages":["eng"],"rights":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10477/86669","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Zhuang, Jun","Industrial and Systems Engineering"]},{"key":"dc:creator","label":"Author","values":["Dayanand, Anjarlekar Sujay"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-02-21T21:36:16Z","2020"]},{"key":"dc:publisher","label":"Institution","values":["State University of New York at Buffalo"]},{"key":"dc:type","label":"Dc Type","values":["Text","Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["operations research"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/10477/86669"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["M.S.","In the era of internet, the online advertising is the best way to reach the customers and so it has become main income source for many websites. The online search engines are best way to find the information about anything as it shows millions of results for a word or bunch of words. Because of this tendency of the internet users, many companies are paying huge amount of money to search engines. But, from many of those company's ads related to query website shows only few ads because of the space limitation on the webpage. Website selects few from them so as they maximize their income. There are so many algorithms available for selecting and allocating the best few ads to every customer as per the history. This research is presenting the new algorithm for maximizing the short-term income of the website with best allocation of ads on web page with contract including combination of pay per click and pay per impression. This research study includes two main things, first is the mathematical optimization model and second is heuristic algorithm for it. The mathematical optimization model is then converted to the network optimization problem and heuristic approach has been designed with the help of Metropolis-Hasting Algorithm and Maximum cardinality matching of bipartite graph.","**To request an accessible version of the file(s) associated with this item, contact library@buffalo.edu. Please include the item's persistent URL [http://hdl.handle.net/. . .] in your request.**"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Optimization of Online Advertising on Search Engines"]}]}],"canonical_facts":{"dc:contributor":["Zhuang, Jun","Industrial and Systems Engineering"],"dc:creator":["Dayanand, Anjarlekar Sujay"],"dc:date":["2025-02-21T21:36:16Z","2020"],"dc:description":["M.S.","In the era of internet, the online advertising is the best way to reach the customers and so it has become main income source for many websites. The online search engines are best way to find the information about anything as it shows millions of results for a word or bunch of words. Because of this tendency of the internet users, many companies are paying huge amount of money to search engines. But, from many of those company's ads related to query website shows only few ads because of the space limitation on the webpage. Website selects few from them so as they maximize their income. There are so many algorithms available for selecting and allocating the best few ads to every customer as per the history. This research is presenting the new algorithm for maximizing the short-term income of the website with best allocation of ads on web page with contract including combination of pay per click and pay per impression. This research study includes two main things, first is the mathematical optimization model and second is heuristic algorithm for it. The mathematical optimization model is then converted to the network optimization problem and heuristic approach has been designed with the help of Metropolis-Hasting Algorithm and Maximum cardinality matching of bipartite graph.","**To request an accessible version of the file(s) associated with this item, contact library@buffalo.edu. Please include the item's persistent URL [http://hdl.handle.net/. . .] in your request.**"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/10477/86669"],"dc:language":["eng"],"dc:publisher":["State University of New York at Buffalo"],"dc:rights":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."],"dc:subject":["operations research"],"dc:title":["Optimization of Online Advertising on Search Engines"],"dc:type":["Text","Thesis"]},"updated_at":"2026-07-27T19:05:34Z"}