MASTER THESIS IN MICRODATA ANALYSIS Is the p-median solution improving monotonically with a denser network? Author: Zhiguang Dan, Xiaoyun Zhao

Source URL: www.statistics.du.se

• Mathematical optimization
• Operations research
• Simulated annealing
• Heuristics
• Algorithm
• Local search
• Greedy algorithm
• Heuristic function
• Local optimum
• Mathematics
• Numerical analysis
• Applied mathematics

BRICS Basic Research in Computer Science BRICS RS-01-6 Gutin et al.: Domination Analysis of Greedy-Type Heuristics for the TSP

Source URL: www.brics.dk

• Operations research
• NP-complete problems
• Nearest neighbour algorithm
• Integer sequences
• Greedy algorithm
• Domination analysis
• Factorial
• Heuristic function
• Summation
• Mathematics
• Approximation algorithms
• Travelling salesman problem

Don’t be greedy when calculating hypervolume contributions Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

Wing Wing is part of David’s Icarus installation which is based on the Greek myth about the boy who flew too close to the Sun. If flown well, a wing can soar effortlessly in balance. If we get too greedy and try to fl

Source URL: www.davidtrubridge.com

Non-greedy Active Learning for Text Categorization using Convex Transductive Experimental Design Kai Yu, Shenghuo Zhu, Wei Xu, Yihong Gong NEC Laboratories America, Cupertino, California 95014 {kyu,

Source URL: www.dbs.ifi.lmu.de

Published in Neural Computation 15(2), pages, Efficient Greedy Learning of Gaussian Mixture Models J.J. Verbeek N. Vlassis B. Kr¨ose

Source URL: lear.inrialpes.fr

Algorithmic Game Theory - handout 11 and 12 Uriel FeigeJune, 2013 We discussed the maximum welfare problem with submodular bidders and fractionally subadditive bidders. We presented greedy algorithms and algorithm

Source URL: www.wisdom.weizmann.ac.il

On the greedy walk problem Charles Bordenave∗, ¨ nter Last‡ Sergey Foss† and Gu April 20, 2011

Source URL: www.math.kit.edu

Algorithms – handout 2 Greedy Algorithms and Matroids March 31, 2014 We shall study several problems that can be solved to optimality in polynomial time using the greedy algorithm. One class of such problems is referre

Source URL: www.wisdom.weizmann.ac.il

A Greedy Approximation Algorithm for Minimum-Gap Scheduling Marek Chrobak1? , Uriel Feige2 , Mohammad Taghi Hajiaghayi3?? , Sanjeev Khanna4 , Fei Li5? ? ? , and Seffi Naor6 1

Source URL: www.wisdom.weizmann.ac.il