Find link

language:

Find link is a tool written by Edward Betts.

searching for Discrete optimization 78 found (109 total)

Ellis L. Johnson (676 words) [view diff] exact match in snippet view article find links to article

National Academy of Engineering for fundamental contributions to discrete optimization and software design, and its practical applications to distribution

Combinatorial optimization (1,847 words) [view diff] exact match in snippet view article find links to article

literature on polynomial-time algorithms for certain special classes of discrete optimization. A considerable amount of it is unified by the theory of linear

Fred W. Glover (1,267 words) [view diff] exact match in snippet view article find links to article

contributed to the fields of network optimization artificial intelligence discrete optimization, simulation optimization, and quantum-inspired computing, and co-founded

Jon Lee (mathematician) (413 words) [view diff] exact match in snippet view article

University of Michigan. He is known for his research in nonlinear discrete optimization and combinatorial optimization. Lee graduated from Stuyvesant High

William J. Cook (569 words) [view diff] exact match in snippet view article find links to article

Engineering in 2011 for theoretical and computational contributions to discrete optimization. He is known for his work on the traveling salesman problem and

Nearest neighbour algorithm (466 words) [view diff] case mismatch in snippet view article find links to article

fails. Discrete Optimization 1 (2004), 121–127. G. Bendall and F. Margot, Greedy Type Resistance of Combinatorial Problems, Discrete Optimization 3 (2006)

Iterated local search (798 words) [view diff] exact match in snippet view article find links to article

modification of local search or hill climbing methods for solving discrete optimization problems. Local search methods can get stuck in a local minimum

David Shmoys (1,787 words) [view diff] exact match in snippet view article find links to article

major focus has been in the design and analysis of algorithms for discrete optimization problems. In particular, his work has highlighted the role of linear

Shmuel Onn (1,423 words) [view diff] exact match in snippet view article find links to article

Lecture Series on Nonlinear Discrete Optimization at MSRI, Berkeley Shmuel Onn, Technion Shmuel Onn. Nonlinear discrete optimization: An algorithmic theory

Eugene Lawler (1,211 words) [view diff] exact match in snippet view article find links to article

and scheduling: a survey", Discrete optimization I: proceedings of the Advanced research institute on discrete optimization and systems applications, Annals

Greedy algorithm (1,918 words) [view diff] case mismatch in snippet view article find links to article

Gregory; Yeo, Anders (2004). "When the greedy algorithm fails". Discrete Optimization. 1 (2): 121–127. doi:10.1016/j.disopt.2004.03.007. Bendall, Gareth;

Graver basis (2,144 words) [view diff] exact match in snippet view article find links to article

\ Ax=b,\ l\leq x\leq u\}\ .} It is one of the most fundamental discrete optimization problems and has a very broad modeling power and numerous applications

Gérard Cornuéjols (423 words) [view diff] exact match in snippet view article find links to article

Prize of INFORMS "for his fundamental and broad contributions to discrete optimization including his deep research on balanced and ideal matrices, perfect

Outline of combinatorics (683 words) [view diff] case mismatch in snippet view article find links to article

Mathematics Discrete Mathematics & Theoretical Computer Science Discrete Optimization Discussiones Mathematicae Graph Theory Electronic Journal of Combinatorics

Thomas Lengauer (756 words) [view diff] exact match in snippet view article find links to article

eighties and early nineties, Lengauer's research concentrated on discrete optimization methods for the design of integrated circuits and on packing problems

Robust optimization (3,410 words) [view diff] case mismatch in snippet view article find links to article

Princeton University Press. Bertsimas, D.; Sim, M. (2003). "Robust Discrete Optimization and Network Flows". Mathematical Programming. 98 (1–3): 49–71. CiteSeerX 10

Michel Bierlaire (1,781 words) [view diff] exact match in snippet view article find links to article

applications in operations research that include continuous and discrete optimization, queuing theory, graphs, and simulation. Apart from implementations

John von Neumann Theory Prize (637 words) [view diff] exact match in snippet view article find links to article

School of Business for his fundamental and broad contributions to discrete optimization including his deep research on balanced and ideal matrices, perfect

Computers and Intractability (779 words) [view diff] case mismatch in snippet view article find links to article

Scheduling Problems Parameterized by Partial Order Width". DOOR 2016: Discrete Optimization and Operations Research. Lecture Notes in Computer Science. Vol

Spanish Statistics and Operations Research Society (610 words) [view diff] exact match in snippet view article find links to article

decision-making problems. The topics covered are continuous and discrete optimization, games, decision theory, logistics, production planning, stochastic

Alexander Schrijver (941 words) [view diff] exact match in snippet view article find links to article

Society and SIAM for "deep and fundamental research contributions to discrete optimization". In 2006, he was a joint winner of the INFORMS John von Neumann

Selmer M. Johnson (502 words) [view diff] case mismatch in snippet view article find links to article

(2008), "George Dantzig's contributions to integer programming", Discrete Optimization, 5 (2): 168–173, doi:10.1016/j.disopt.2007.08.003. Gass, Saul I

Panos Kouvelis (1,489 words) [view diff] case mismatch in snippet view article find links to article

publication of IIE Transactions. Research monograph on “Robust Discrete Optimization and its Applications.” Kluwer Academic Publishers, Amsterdam, 1997

McGill University School of Computer Science (1,013 words) [view diff] exact match in snippet view article find links to article

in 2000/2001. The Trottier Building opened in 2003. David Avis - Discrete optimization and computational geometry Claude Crépeau - Quantum computing and

Robertson–Webb query model (2,139 words) [view diff] case mismatch in snippet view article find links to article

Woeginger and Jiri Sgall (2007). "On the complexity of cake cutting". Discrete Optimization. 4 (2): 213–220. doi:10.1016/j.disopt.2006.07.003. Edmonds, Jeff

Peter L. Hammer (569 words) [view diff] case mismatch in snippet view article find links to article

the journals Discrete Mathematics, Discrete Applied Mathematics, Discrete Optimization, Annals of Discrete Mathematics, Annals of Operations Research,

Even–Paz protocol (986 words) [view diff] case mismatch in snippet view article find links to article

Woeginger, Gerhard J. (2007). "On the complexity of cake cutting". Discrete Optimization. 4 (2): 213–220. doi:10.1016/j.disopt.2006.07.003. Edmonds, Jeff

NEOS Server (546 words) [view diff] case mismatch in snippet view article find links to article

Margaret H. (May 2008). "George B. Dantzig and systems optimization". Discrete Optimization. 5 (2): 151–158. CiteSeerX 10.1.1.601.2627. doi:10.1016/j.disopt

Optimal job scheduling (2,974 words) [view diff] case mismatch in snippet view article find links to article

Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium. Elsevier

Endre Boros (536 words) [view diff] case mismatch in snippet view article find links to article

bounds for quadratic unconstrained binary optimization (QUBO)", Discrete Optimization, 5 (2): 501–529, doi:10.1016/j.disopt.2007.02.001, MR 2408438. Boros

Dickson's lemma (1,172 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-1-4577-0451-2, MR 2858898, S2CID 9178090. Onn, Shmuel (2008), "Convex Discrete Optimization", in Floudas, Christodoulos A.; Pardalos, Panos M. (eds.), Encyclopedia

William O. Baker Award for Initiatives in Research (1,171 words) [view diff] exact match in snippet view article find links to article

solve fundamental problems in network, information extraction, and discrete optimization. Kenneth A. Farley (2000, geochemistry/geophysics) For his insightful

William O. Baker Award for Initiatives in Research (1,171 words) [view diff] exact match in snippet view article find links to article

solve fundamental problems in network, information extraction, and discrete optimization. Kenneth A. Farley (2000, geochemistry/geophysics) For his insightful

K shortest path routing (1,245 words) [view diff] case mismatch in snippet view article find links to article

(1972-03-01). "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem". Management

Parallel task scheduling (2,520 words) [view diff] case mismatch in snippet view article find links to article

Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium. Elsevier

Peter Pruzan (958 words) [view diff] case mismatch in snippet view article find links to article

Business School Press. Pruzan, P. (1981). Locational Decisions and Discrete Optimization. Copenhagen: University of Copenhagen. Pruzan, Peter Mark (1964)

Narsingh Deo (203 words) [view diff] case mismatch in snippet view article find links to article

Computers, Prentice-Hall, Englewood Cliffs, N.J., 1979, 200 pages. Discrete Optimization Algorithms: With Pascal Programs (with M.M. Syslo and J. S. Kowalik)

Set packing (1,514 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-3-540-65367-7. [1]: A Pascal program for solving the problem. From Discrete Optimization Algorithms with Pascal Programs by MacIej M. Syslo, ISBN 0-13-215509-5

Ramin Zabih (236 words) [view diff] exact match in snippet view article find links to article

of the Association for Computing Machinery "for contributions to discrete optimization in computer vision" He was named Fellow of the Institute of Electrical

Amit Sahai (1,154 words) [view diff] exact match in snippet view article find links to article

creative, and influential research in the areas of combinatorial and discrete optimization, or related parts of computer science, such as the design and analysis

Julia Robinson (2,184 words) [view diff] case mismatch in snippet view article find links to article

history of combinatorial optimization (till 1960). Handbook of Discrete Optimization (K. Aardal, G.L. Nemhauser, R. Weismantel, eds.), Elsevier, Amsterdam

Kyoto Prize in Basic Sciences (551 words) [view diff] case mismatch in snippet view article find links to article

1948 Outstanding Contributions to Mathematical Sciences Based on Discrete Optimization Algorithms 2014 Edward Witten United States born 1951 Outstanding

Bellman–Ford algorithm (2,854 words) [view diff] case mismatch in snippet view article find links to article

history of combinatorial optimization (till 1960)" (PDF). Handbook of Discrete Optimization. Elsevier: 1–68. Cormen, Thomas H.; Leiserson, Charles E.; Rivest

Carolina Osorio (453 words) [view diff] exact match in snippet view article find links to article

network optimization driven by high-resolution data, simulation and discrete optimization | Cornell Engineering". www.engineering.cornell.edu. Retrieved October

Wald's maximin model (1,937 words) [view diff] case mismatch in snippet view article find links to article

Risk Finance, 9(3), 287-91. Kouvelis P, and Yu G. (1997). Robust Discrete Optimization and Its Applications, Kluwer, Boston. Ben-Tal, A, El Gaoui, L, Nemirovski

Unrooted binary tree (1,967 words) [view diff] case mismatch in snippet view article find links to article

Wolsey L (2020). "On the Balanced Minimum Evolution Polytope". Discrete Optimization. 36: 100570. doi:10.1016/j.disopt.2020.100570. S2CID 213389485.

Marco Dorigo (409 words) [view diff] exact match in snippet view article find links to article

Colombetti, MIT Press, 1998 (ISBN 0-262-04164-2). Ant algorithms for discrete optimization with Gianni Di Caro and Luca Maria Gambardella, Artificial Life

Distance-hereditary graph (2,290 words) [view diff] case mismatch in snippet view article find links to article

"Computing maximum stable sets for distance-hereditary graphs", Discrete Optimization, 2 (2): 185–188, doi:10.1016/j.disopt.2005.03.004, MR 2155518. Cornelsen

Vojtěch Jarník (2,201 words) [view diff] exact match in snippet view article find links to article

55–66, ISBN 80-7196-156-6. Durnová, Helena (2004), "A history of discrete optimization", in Fuchs, Eduard (ed.), Mathematics Throughout the Ages, Vol.

Paul Tseng (661 words) [view diff] exact match in snippet view article find links to article

research primarily in continuous optimization and secondarily in discrete optimization and distributed computation. Tseng made many contributions to mathematical

Convex cone (3,941 words) [view diff] case mismatch in snippet view article find links to article

Matthias (2012-01-01). Algebraic and Geometric Ideas in the Theory of Discrete Optimization. SIAM. ISBN 9781611972443. Schrijver, Alexander (1998-07-07). Theory

Clique-width (2,057 words) [view diff] case mismatch in snippet view article find links to article

"Computing maximum stable sets for distance-hereditary graphs", Discrete Optimization, 2 (2): 185–188, doi:10.1016/j.disopt.2005.03.004, MR 2155518. Corneil

John Hopfield (3,180 words) [view diff] exact match in snippet view article find links to article

David W. Tank, Hopfield developed a method in 1985–1986 for solving discrete optimization problems based on the continuous-time dynamics using a Hopfield

Particle swarm optimization (5,222 words) [view diff] exact match in snippet view article find links to article

(2010). "A novel set-based particle swarm optimization method for discrete optimization problem". IEEE Transactions on Evolutionary Computation. 14 (2):

Submodular set function (3,349 words) [view diff] case mismatch in snippet view article find links to article

S2CID 206800425. Williamson, David P. "Bridging Continuous and Discrete Optimization: Lecture 23" (PDF). G. Calinescu, C. Chekuri, M. Pál and J. Vondrák

Yen's algorithm (2,179 words) [view diff] exact match in snippet view article find links to article

EL (1972). "A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem". Management

Ignacio Grossmann (1,376 words) [view diff] case mismatch in snippet view article find links to article

AIChE, 2011 Basore Distinguished Lecture, Auburn University, 2011 Discrete Optimization Top Cited Article 2005-2010 Warren Lewis Award for Excellence in

Equitable cake-cutting (2,082 words) [view diff] case mismatch in snippet view article find links to article

Eva (2012-11-01). "On the computability of equitable divisions". Discrete Optimization. 9 (4): 249–257. doi:10.1016/j.disopt.2012.08.001. ISSN 1572-5286

Scandinavian Conference on Image Analysis (903 words) [view diff] case mismatch in snippet view article find links to article

Tampere University, Finland. Best Nordic Thesis Award 2013-2014: “Discrete Optimization in Early Vision” by Petter Strandmark, Lund University, Sweden.

Weighted constraint satisfaction problem (1,307 words) [view diff] case mismatch in snippet view article find links to article

Schiex, M Zytnicki, S de Givry. Multi-Language Evaluation of Exact Solvers in Graphical Model Discrete Optimization. Constraints, 21(3):413-434, 2016.

Gaussian adaptation (3,037 words) [view diff] case mismatch in snippet view article find links to article

no. 7, July 1981. Kjellström, G., Taxén, L. and Lindberg, P. O. Discrete Optimization of Digital Filters Using Gaussian Adaptation and Quadratic Function

De novo sequence assemblers (2,104 words) [view diff] case mismatch in snippet view article find links to article

Bang-Jensen; G. Gutin; A. Yeo (2004). "When the greedy algorithm fails". Discrete Optimization. 1 (2): 121–127. doi:10.1016/j.disopt.2004.03.007. Peltola, Hannu;

Toshihide Ibaraki (635 words) [view diff] exact match in snippet view article find links to article

Machinery in 1999, "for contributions to the theory and algorithms of discrete optimization, graphs and networks, and logical analysis of data with Boolean

Minimum evolution (2,440 words) [view diff] case mismatch in snippet view article find links to article

Wolsey L (2020). "On the Balanced Minimum Evolution Polytope". Discrete Optimization. 36: 100570. doi:10.1016/j.disopt.2020.100570. S2CID 213389485.

Knapsack problem (7,799 words) [view diff] case mismatch in snippet view article find links to article

(2009). "A hybrid algorithm for the unbounded knapsack problem". Discrete Optimization. 6 (1): 110–124. doi:10.1016/j.disopt.2008.09.004. ISSN 1572-5286

Feature selection (6,925 words) [view diff] case mismatch in snippet view article find links to article

feature selection measures". Proceedings of the NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & Polyhedra (DISCML)

Warsaw (19,109 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 20 October 2017. Zawidzki, Machi (15 September 2016). Discrete Optimization in Architecture: Building Envelope. Springer. ISBN 9789811013911

Abraham B Korol (1,338 words) [view diff] exact match in snippet view article find links to article

developed in Korol's lab to efficiently tackle this subsequent discrete optimization problem (with complexity ~n! where n~102-103). Another complementary

Info-gap decision theory (4,245 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1080/00207548708919855. P. Kouvelis and G. Yu, 1997, Robust Discrete Optimization and Its Applications, Kluwer. B. Rustem and M. Howe, 2002, Algorithms

Travelling salesman problem (11,633 words) [view diff] case mismatch in snippet view article find links to article

In K. Aardal; G.L. Nemhauser; R. Weismantel (eds.). Handbook of Discrete Optimization (PDF). Amsterdam: Elsevier. pp. 1–68. Serdyukov, A. I. (1984), "An

Lateral computing (4,212 words) [view diff] case mismatch in snippet view article find links to article

M.; DI CARO, G.; Gamberella, L. M. (1999). Ant Algorithms for Discrete Optimization, Artificial Life. MIT Press. Bradshaw, J. M. (1997). Software Agents

Proportional cake-cutting (3,416 words) [view diff] case mismatch in snippet view article find links to article

Woeginger and Jiri Sgall (2007). "On the complexity of cake cutting". Discrete Optimization. 4 (2): 213–220. doi:10.1016/j.disopt.2006.07.003. Edmonds, Jeff

Ant colony optimization algorithms (9,487 words) [view diff] case mismatch in snippet view article find links to article

Dorigo, G. Di Caro & L. M. Gambardella, 1999. "Ant Algorithms for Discrete Optimization Archived 2018-10-06 at the Wayback Machine". Artificial Life, 5

Table of metaheuristics (3,875 words) [view diff] exact match in snippet view article find links to article

"Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization". Engineering Optimization. 38 (2): 129–154. doi:10.1080/03052150500384759

Quadratic knapsack problem (3,911 words) [view diff] case mismatch in snippet view article find links to article

enhancement strategies for linearizing mixed 0-1 quadratic programs". Discrete Optimization. 1 (2): 99–120. doi:10.1016/j.disopt.2004.03.006. Adams, Warren

Philippe Baptiste (4,439 words) [view diff] case mismatch in snippet view article find links to article

minimize a regular objective function under setup constraints". Discrete Optimization. 2 (1): 83–99. doi:10.1016/j.disopt.2004.12.003. ISSN 1572-5286

Balanced number partitioning (3,242 words) [view diff] case mismatch in snippet view article find links to article

"Computer-assisted proof of performance ratios for the Differencing Method". Discrete Optimization. 9 (1): 1–16. doi:10.1016/j.disopt.2011.10.001. ISSN 1572-5286.

Strip packing problem (7,808 words) [view diff] case mismatch in snippet view article find links to article

"Rectangle packing with one-dimensional resource augmentation". Discrete Optimization. 6 (3): 310–323. doi:10.1016/j.disopt.2009.04.001. Bougeret, Marin;