Find link

language:

Find link is a tool written by Edward Betts.

searching for Packing problems 30 found (133 total)

Brenda Baker (532 words) [view diff] exact match in snippet view article find links to article

duplicate code detection, and for her research on two-dimensional bin packing problems. Baker did her undergraduate studies at Radcliffe College. She earned

Difference-map algorithm (1,617 words) [view diff] exact match in snippet view article find links to article

numbers, diophantine equations, and Sudoku, as well as sphere- and disk-packing problems. Since these applications include NP-complete problems, the scope of

Paolo Toth (498 words) [view diff] exact match in snippet view article find links to article

contributions in the areas of vehicle routing, knapsack and other cutting and packing problems, train scheduling, set covering, vertex coloring and, in general, combinatorial

Unit fraction (2,984 words) [view diff] exact match in snippet view article find links to article

{\displaystyle 1/n} . In the study of combinatorial optimization problems, bin packing problems involve an input sequence of items with fractional sizes, which must

Salvatore Torquato (7,364 words) [view diff] exact match in snippet view article find links to article

identification of sensitive order metrics. He is one of the world's experts on packing problems, including pioneering the notion of the "maximally random jammed" state

26 (number) (611 words) [view diff] exact match in snippet view article

Lorentzian unimodular lattice II25,1 plays a significant role in sphere packing problems and the classification of finite simple groups. In particular, the

Prabhakar Raghavan (1,135 words) [view diff] case mismatch in snippet view article find links to article

Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems". UC Berkeley. Retrieved 19 May 2014. Advisor: Clark D. Thompson Roth

Julia Böttcher (288 words) [view diff] exact match in snippet view article find links to article

Her research involves graph theory, including graph and hypergraph packing problems, random graphs and random subgraphs, and the relations between graph

Longest path problem (2,662 words) [view diff] exact match in snippet view article find links to article

Zhang, Fenghui (2007), "Improved algorithms for path, matching, and packing problems", Proc. 18th ACM-SIAM Symposium on Discrete algorithms (SODA '07) (PDF)

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

optimization methods for the design of integrated circuits and on packing problems in manufacturing. From 1992 to 2001 he was Professor of Computer Science

Clay Research Award (71 words) [view diff] exact match in snippet view article find links to article

structures." "In recognition of her groundbreaking work on sphere-packing problems in eight and twenty-four dimensions." 2016 Mark Gross and Bernd Siebert

Ron Rivest (1,543 words) [view diff] exact match in snippet view article find links to article

1980s, he also published well-cited research on two-dimensional bin packing problems,[A5] and on channel routing in VLSI design.[A6] He is a co-author of

Variable neighborhood search (3,224 words) [view diff] exact match in snippet view article find links to article

communication Location problems Data mining Graph problems Knapsack and packing problems Mixed integer problems Time tabling Scheduling Vehicle routing problems

Rectilinear polygon (1,571 words) [view diff] exact match in snippet view article find links to article

equal to the polygon. The units may overlap. See Polygon covering. In packing problems, the goal is to find a largest set of non-overlapping units whose union

Eternity II puzzle (1,746 words) [view diff] exact match in snippet view article find links to article

NP-complete, the same can be said of the general class of polygon packing problems, of which the original Eternity puzzle was a special case. Like the

Boxicity (1,554 words) [view diff] exact match in snippet view article find links to article

Ramaswami, S. (2001), "Efficient approximation algorithms for tiling and packing problems with rectangles", J. Algorithms, 41 (2): 443–470, doi:10.1006/jagm

Guillotine cutting (4,129 words) [view diff] exact match in snippet view article find links to article

variants of the two-dimensional cutting stock, bin packing and rectangle packing problems, where the cuts are constrained to be guillotine cuts. In the basic

Square (8,941 words) [view diff] exact match in snippet view article find links to article

named for its connection to proofs of the Pythagorean theorem. Square packing problems seek the smallest square or circle into which a given number of unit

Vasily Vladimirov (1,173 words) [view diff] exact match in snippet view article find links to article

Fedoseevich Voronoy's conjecture. In his second thesis, he approached packing problems for convex bodies initiated by Hermann Minkowski. Upon graduation,

Ronald Graham (4,467 words) [view diff] case mismatch in snippet view article find links to article

Garey, M. R.; Johnson, D. S. (1981). "Approximation Algorithms for Bin Packing Problems: A Survey". In Ausiello, G.; Lucertini, M. (eds.). Analysis and Design

László Fejes Tóth (2,552 words) [view diff] exact match in snippet view article find links to article

University of Kolozsvár (Cluj). It was here that he became interested in packing problems. In 1944, he returned to Budapest to teach mathematics at Árpád High

Soddy's hexlet (2,096 words) [view diff] exact match in snippet view article find links to article

hexlet over one hundred years before Soddy did. They analysed the packing problems in which circles and polygons, balls and polyhedrons come into contact

Configuration linear program (2,459 words) [view diff] exact match in snippet view article find links to article

(2006-10-01). "Improved approximation algorithms for multidimensional bin packing problems". 2006 47th Annual IEEE Symposium on Foundations of Computer Science

Maximum coverage problem (1,762 words) [view diff] case mismatch in snippet view article find links to article

(1978), 265–294 Hochbaum, Dorit S. (1997). "Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems". In

Shen Kuo (12,181 words) [view diff] exact match in snippet view article find links to article

of small increments" laid the foundation in Chinese mathematics for packing problems involving equal difference series. Sal Restivo writes that Shen used

List of unsolved problems in mathematics (20,026 words) [view diff] exact match in snippet view article find links to article

packing density of all centrally-symmetric convex plane sets Sphere packing problems, including the density of the densest packing in dimensions other than

AM–GM inequality (7,999 words) [view diff] exact match in snippet view article find links to article

triangles, ⁠HM/GM⁠ = ⁠GM/AM⁠ ∴ HM = ⁠GM²/AM⁠ = HM. Hoffman, D. G. (1981), "Packing problems and inequalities", in Klarner, David A. (ed.), The Mathematical Gardner

Matroid oracle (4,287 words) [view diff] exact match in snippet view article find links to article

Kelmans, A. K.; Polesskiĭ, V. P. (1994), "Extremal sets and covering and packing problems in matroids", Selected topics in discrete mathematics (Moscow, 1972–1990)

List of women in mathematics (23,282 words) [view diff] exact match in snippet view article find links to article

Viazovska (born 1984), Ukrainian mathematician, solved the sphere packing problems in dimensions 8 and 24 Eva Viehmann (born 1980), German arithmetic

Maximum disjoint set (4,745 words) [view diff] exact match in snippet view article find links to article

D. S.; Maass, W. (1985). "Approximation schemes for covering and packing problems in image processing and VLSI". Journal of the ACM. 32: 130–136. doi:10