language:

Find link is a tool written by Edward Betts.

searching for Linear programming 151 found (674 total)

alternate case: linear programming

Albert W. Tucker (812 words) [view diff] exact match in snippet view article find links to article

who made important contributions in topology, game theory, and non-linear programming. Albert Tucker was born in Oshawa, Ontario, Canada, and earned his
Constrained conditional model (1,430 words) [view diff] case mismatch in snippet view article find links to article
In most applications of this framework in NLP, following, Integer Linear Programming (ILP) was used as the inference framework, although other algorithms
Least absolute deviations (2,060 words) [view diff] exact match in snippet view article find links to article
algorithm) Because the problem is a linear program, any of the many linear programming techniques (including the simplex method as well as others) can be
Second-order cone programming (880 words) [view diff] no match in snippet view article find links to article
A second-order cone program (SOCP) is a convex optimization problem of the form minimize   f T x   {\displaystyle \ f^{T}x\ } subject to ‖ A i x + b i
Cutting stock problem (2,389 words) [view diff] exact match in snippet view article find links to article
the knapsack problem. The problem can be formulated as an integer linear programming problem. A paper machine can produce an unlimited number of master
Robert Dorfman (967 words) [view diff] case mismatch in snippet view article find links to article
allocation captured the profession's imagination." Dorfman co-authored "Linear Programming and Economic Analysis" with Solow and economist Paul A. Samuelson
Abraham Charnes (226 words) [view diff] case mismatch in snippet view article find links to article
200 research articles and seven books, including An Introduction to Linear Programming. His works influenced the development of Data envelopment analysis
Conjoint analysis (1,907 words) [view diff] exact match in snippet view article find links to article
professor V. "Seenu" Srinivasan of Stanford University who developed a linear programming (LINMAP) procedure for rank ordered data as well as a self-explicated
LPBoost (1,949 words) [view diff] case mismatch in snippet view article find links to article
Linear Programming Boosting (LPBoost) is a supervised classifier from the boosting family of classifiers. LPBoost maximizes a margin between training samples
Combinatorica (408 words) [view diff] exact match in snippet view article find links to article
solving linear programming problems in polynomial time, awarded the 1988 Fulkerson Prize. N. Karmarkar: A New Polynomial Time Algorithm for Linear Programming
Olga Bondareva (631 words) [view diff] exact match in snippet view article find links to article
p. 119—139. translated as : Bondareva O. N. Some applications of linear programming to the theory of cooperative games // Selected Russian Papers in Game
Software pipelining (1,991 words) [view diff] exact match in snippet view article find links to article
practice. Gao et al. formulated optimal software pipelining in integer linear programming, culminating in validation of advanced heuristics in an evaluation
Strictly determined game (169 words) [view diff] case mismatch in snippet view article find links to article
"Elementary aspects of the theory of games". An Introduction to Linear Programming and the Theory of Games. Courier Dover Publications. p. 94. ISBN 9780486417103
Faina Mihajlovna Kirillova (561 words) [view diff] exact match in snippet view article find links to article
application. She also developed a new numerical approach to solving linear programming problems, and she created numerical methods for the solution of linear
Nimrod Megiddo (266 words) [view diff] case mismatch in snippet view article find links to article
including parametric searches, interior point methods, low dimension Linear Programming, probabilistic analysis of the simplex method and computational game
Scott W. Sloan (571 words) [view diff] exact match in snippet view article find links to article
W. (1988). "Lower bound limit analysis using finite elements and linear programming". International Journal for Numerical and Analytical Methods in Geomechanics
Linear function (621 words) [view diff] case mismatch in snippet view article find links to article
Brooks/Cole. ISBN 978-0-538-49790-9 Leonid N. Vaserstein (2006), "Linear Programming", in Leslie Hogben, ed., Handbook of Linear Algebra, Discrete Mathematics
Nina Amenta (289 words) [view diff] exact match in snippet view article find links to article
with a thesis on relations between Helly's theorem and generalized linear programming, supervised by Raimund Seidel. After postdoctoral study at The Geometry
Zuse Institute Berlin (402 words) [view diff] exact match in snippet view article find links to article
constraints. It supports about 20 constraint types for mixed-integer linear programming, mixed-integer nonlinear programming, mixed-integer all-quadratic
NPO 1 Extra (298 words) [view diff] exact match in snippet view article find links to article
regularly passes in shortened or compiled versions. NPO 1 Extra has a linear programming with many regular program titles in the early evening. The soap Onderweg
Land-use forecasting (5,997 words) [view diff] case mismatch in snippet view article find links to article
Application of Generalized Linear Programming to Network Flows SIAM Journal, 10, 260—83, 1962. Harris, Britton, Linear Programming and the Projection of Land
System of linear equations (5,333 words) [view diff] exact match in snippet view article find links to article
theories have been developed, see Linear equation over a ring. Integer linear programming is a collection of methods for finding the "best" integer solution
Short swing (325 words) [view diff] exact match in snippet view article find links to article
as well as up to six months later and the correct calculation is a linear programming problem As stated by a federal circuit court of appeals: In order
John Brooks Slaughter (327 words) [view diff] exact match in snippet view article find links to article
solution of a class of optimal control problems by linear and piecewise-linear programming techniques (Ph.D.). University of California, San Diego. OCLC 17797905
Algebraic modeling language (944 words) [view diff] exact match in snippet view article find links to article
Lucas; Shirley Moody; Bjarni Kristjansson (1995). "Sets and indices in linear programming modelling and their integration with relational data models". Computational
RAPTOR (software) (1,124 words) [view diff] case mismatch in snippet view article
Li M, Kim D, Xu Y (2003). "RAPTOR: Optimal Protein Threading by Linear Programming, the inaugural issue". J Bioinform Comput Biol. 1 (1): 95–117. doi:10
Hashiwokakero (739 words) [view diff] exact match in snippet view article find links to article
integer-coordinate unit distance graphs. There is a solution using integer linear programming in the MathProg examples included in GLPK.[citation needed]. A library
Multiple-criteria decision analysis (5,385 words) [view diff] exact match in snippet view article find links to article
the decision variables, this variation leads to multiple objective linear programming (MOLP), an important subclass of MCDM problems. There are several
Constraint composite graph (653 words) [view diff] exact match in snippet view article find links to article
more advantageous to apply message passing algorithms and integer linear programming on the WCSP's constraint composite graph than on the WCSP directly
P-cycle protection (2,903 words) [view diff] case mismatch in snippet view article find links to article
steps until the working capacity on every span is 0. The Integer Linear Programming (ILP) method for creating p-cycles requires that all possible sets
Institute for Operations Research and the Management Sciences (1,236 words) [view diff] exact match in snippet view article find links to article
analysis, financial engineering, information systems, linear programming, logistics, non-linear programming, optimization, simulation, stochastic programming
Tucker Prize (388 words) [view diff] case mismatch in snippet view article find links to article
sequential and parallel computers". 1991: Michel Goemans for "Analysis of Linear Programming Relaxations for a Class of Connectivity Problems". Other Finalists:
Optical flow (2,265 words) [view diff] exact match in snippet view article find links to article
solution is often recovered through Max-flow min-cut theorem algorithms, linear programming or belief propagation methods. Many of these, in addition to the current
Control-Lyapunov function (1,141 words) [view diff] exact match in snippet view article find links to article
simplifies considerably, in fact it reduces to solving a static non-linear programming problem u ∗ ( x ) = a r g m i n u ∇ V ( x ) ⋅ f ( x , u ) {\displaystyle
Infinite-dimensional optimization (337 words) [view diff] case mismatch in snippet view article find links to article
Wiley & Sons. ISBN 0-471-18117-X. Edward J. Anderson and Peter Nash, Linear Programming in Infinite-Dimensional Spaces, Wiley, 1987. M. A. Goberna and M.
Jiří Matoušek (mathematician) (830 words) [view diff] case mismatch in snippet view article
Combinatorics 26, 2006. ISBN 978-3-540-33698-3. Understanding and Using Linear Programming (with B. Gärtner). Springer-Verlag, Universitext, 2007, ISBN 978-3-540-30697-9
Star-shaped polygon (479 words) [view diff] exact match in snippet view article find links to article
problem as a linear program and applying techniques for low-dimensional linear programming (see http://www.inf.ethz.ch/personal/emo/PublFiles/SubexLinProg_ALG16_96
Dan Gusfield (1,366 words) [view diff] exact match in snippet view article find links to article
2014 he has focused on the application and development of integer linear programming in computational biology. Gusfield is most well known for his book
Star-shaped polygon (479 words) [view diff] exact match in snippet view article find links to article
problem as a linear program and applying techniques for low-dimensional linear programming (see http://www.inf.ethz.ch/personal/emo/PublFiles/SubexLinProg_ALG16_96
Steven Vajda (877 words) [view diff] case mismatch in snippet view article find links to article
wife). Theory of Games and Linear Programming(1956) Readings in Linear Programming (1958) Introduction to Linear Programming and the Theory of Games (1960)
NMath (175 words) [view diff] exact match in snippet view article find links to article
matrix classes, complex numbers, factorizations, decompositions, linear programming, minimization, root-finding, structured and sparse matrix, least squares
Threading (protein sequence) (1,989 words) [view diff] exact match in snippet view article
Conditional random fields, simulated annealing, branch and bound and linear programming, searching to arrive at heuristic solutions. It is interesting to
Machine Learning (journal) (609 words) [view diff] case mismatch in snippet view article
Ayhan Demiriz and Kristin P. Bennett and John Shawe-Taylor (2002). "Linear Programming Boosting via Column Generation". Machine Learning. 46: 225–254. doi:10
Introduction to Algorithms (808 words) [view diff] case mismatch in snippet view article find links to article
Selected Topics 27 Multithreaded Algorithms 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String
Panulirus pascuensis (572 words) [view diff] case mismatch in snippet view article find links to article
Valuation of Tropical Coastal Resources: Theory and Application of Linear Programming. WorldFish. p. 61. ISBN 971870972X. "Easter Island spiny lobster (Panulirus
Opportunity cost (1,264 words) [view diff] exact match in snippet view article find links to article
cost of \$40. Economics portal Reduced cost aka 'opportunity cost' in linear programming Budget constraint Economic value added Fear of missing out Opportunity
Greatest common divisor (4,227 words) [view diff] exact match in snippet view article find links to article
the Euclidean algorithm) is NC-equivalent to the problem of integer linear programming with two variables; if either problem is in NC or is P-complete, the
SciPy (669 words) [view diff] exact match in snippet view article find links to article
multi-dimensional image processing optimize: optimization algorithms including linear programming signal: signal processing tools sparse: sparse matrix and related
SAMPL (825 words) [view diff] case mismatch in snippet view article find links to article
Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming". Operations Research. 21 (5): 1154–1157. doi:10.1287/opre.21.5.1154
BFS (193 words) [view diff] exact match in snippet view article find links to article
fill seal, a manufacturing technique Basic feasible solution, in linear programming Be File System, the native file system for the Be Operating System
Production planning (970 words) [view diff] exact match in snippet view article find links to article
for semiconductor manufacturing based on iterative simulation and linear programming calculations." Semiconductor Manufacturing, IEEE Transactions on 9
Spatiotemporal database (398 words) [view diff] case mismatch in snippet view article find links to article
approach is the constraint database system such as MLPQ (Management of Linear Programming Queries). GeoMesa is an open-source distributed spatiotemporal index
Turnpike theory (736 words) [view diff] case mismatch in snippet view article find links to article
traces the term to Robert Dorfman, Paul Samuelson, and Robert Solow's Linear Programming and Economic Analysis in 1958, referring to an American English word
Discrete rate simulation (535 words) [view diff] case mismatch in snippet view article find links to article
the emptying rate remains constant. "Discrete Rate Simulation Using Linear Programming" (PDF). Retrieved 2014-03-11. "Simulation of Bulk Flow and High Speed
MIP (319 words) [view diff] exact match in snippet view article find links to article
MIP may refer to: Mixed integer programming, linear programming where some variables are constrained to be integers Minimum Ionizing Particle, in particle
Hirofumi Uzawa (1,746 words) [view diff] exact match in snippet view article find links to article
Hurwicz, Leonid; Uzawa, Hirofumi (1958). Studies in linear and non-linear programming. Stanford mathematical studies in the social sciences. 2. Redwood
Devex algorithm (72 words) [view diff] exact match in snippet view article find links to article
1–28. Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.
Devex algorithm (72 words) [view diff] exact match in snippet view article find links to article
1–28. Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.
Bondareva–Shapley theorem (305 words) [view diff] exact match in snippet view article find links to article
(S)v(S)\leq v(N).} Bondareva, Olga N. (1963). "Some applications of linear programming methods to the theory of cooperative games (In Russian)" (PDF). Problemy
Daniel Spielman (518 words) [view diff] case mismatch in snippet view article find links to article
2010 he was awarded the Nevanlinna Prize "for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory
Control-flow diagram (590 words) [view diff] no match in snippet view article find links to article
phase, the operating-condition constraints, optimal solution, and linear-programming health-status condition codes were recorded. Finally, the actual commands
Binary constraint (172 words) [view diff] exact match in snippet view article find links to article
Megiddo, Nimrod (1983), "Towards a genuinely polynomial algorithm for linear programming", SIAM Journal on Computing, 12 (2): 347–353, CiteSeerX 10.1.1.76
QUIKTRAN (234 words) [view diff] exact match in snippet view article find links to article
execute numerous IBM-supplied programs for applications including linear programming, communication network design, and business programs. The system on
Glossary of game theory (1,945 words) [view diff] case mismatch in snippet view article find links to article
"Elementary aspects of the theory of games". An Introduction to Linear Programming and the Theory of Games. Courier Dover Publications. p. 94. ISBN 9780486417103
Munther A. Dahleh (1,642 words) [view diff] exact match in snippet view article find links to article
addresses robustness in the presence of persistent disturbances- using linear programming techniques. This work pioneered the development of computational approaches
Chief programmer team (308 words) [view diff] case mismatch in snippet view article find links to article
Robert J. (1976). "Experiences in the Development of a Large Scale Linear Programming System". Computers and Mathematical Programming: Proceedings of the
Donald Goldfarb (335 words) [view diff] exact match in snippet view article find links to article
; Goldfarb, Donald (1992). "Steepest-edge simplex algorithms for linear programming". Mathematical Programming. Springer-Verlag. 57: 341–374. doi:10.1007/bf01581089
Economic lot scheduling problem (1,878 words) [view diff] case mismatch in snippet view article find links to article
No. 3, April 1958, pp. 264–291 Welch, W. Evert, A Case of Simple Linear Programming, Management Methods 1956 in Jack D. Rogers: A Computational Approach
Board puzzles with algebra of binary variables (1,655 words) [view diff] exact match in snippet view article find links to article
problem can be modeled as binary integer linear programming which is a special case of integer linear programming. Minesweeper, along with its variants,
Parametric programming (528 words) [view diff] case mismatch in snippet view article find links to article
1016/S0005-1098(01)00174-1. Gal, Tomas; Nedoma, Josef (1972). "Multiparametric Linear Programming". Management Science. 18 (7): 406–422. doi:10.1287/mnsc.18.7.406.
Wolfe duality (419 words) [view diff] exact match in snippet view article find links to article
duality Fenchel duality Philip Wolfe (1961). "A duality theorem for non-linear programming". Quarterly of Applied Mathematics. 19: 239–244. "Chapter 3. Duality
Radiation treatment planning (1,297 words) [view diff] case mismatch in snippet view article find links to article
Position and Dwell Time in Prostate HDR Brachytherapy using HIPO and Linear Programming. World Congress on Medical Physics and Biomedical Engineering. IFMBE
Semi-infinite programming (444 words) [view diff] case mismatch in snippet view article find links to article
1137/1035089. JSTOR 2132425. MR 1234637. Edward J. Anderson and Peter Nash, Linear Programming in Infinite-Dimensional Spaces, Wiley, 1987. Bonnans, J. Frédéric;
Carlton E. Lemke (278 words) [view diff] exact match in snippet view article find links to article
Management Sciences. Lemke, Carlton E. The dual method of solving the linear programming problem, Naval Research Logistics Quarterly, Vol. 1, 1954, pp. 36-47
Substitute good (1,711 words) [view diff] case mismatch in snippet view article find links to article
ISSN 0956-7976. PMID 27142460. Bichler, Martin (2017). Market Design: A Linear Programming Approach to Auctions and Matching. Cambridge University Press. p. 145
Backpropagation through time (746 words) [view diff] case mismatch in snippet view article find links to article
Cuéllar and M. Delgado and M.C. Pegalajar (2006). An Application of Non-linear Programming to Train Recurrent Neural Networks in Time Series Prediction Problems
Undergraduate Texts in Mathematics (4,264 words) [view diff] case mismatch in snippet view article find links to article
ISBN 978-0-387-97040-0. Brickman, Louis (1989). Mathematical Introduction to Linear Programming and Game Theory. Undergraduate Texts in Mathematics. doi:10.1007/978-1-4612-4540-7
Finite element limit analysis (370 words) [view diff] exact match in snippet view article find links to article
S. (1988). Lower bound limit analysis using finite elements and linear programming. Int. J. Num. Anal. Meth. in Geomech. 12(4), 61–77. Kumar, Jyant,
FIR transfer function (902 words) [view diff] exact match in snippet view article find links to article
design method Frequency Sampling method Conventional linear programming Iterative linear programming Define the input signal: y ( t ) = sin ⁡ ( t ) + r
Simplex (disambiguation) (313 words) [view diff] exact match in snippet view article
Simplex algorithm, a popular algorithm for numerical solution of linear programming problems Simplex graph, derived from the cliques of another graph
Computational topology (1,140 words) [view diff] exact match in snippet view article find links to article
several techniques to turn problems in 3-manifold theory into integer linear programming problems. Rubinstein and Thompson's 3-sphere recognition algorithm
Martin Dyer (328 words) [view diff] exact match in snippet view article find links to article
the volume of convex bodies (with Alan Frieze and Ravindran Kannan) linear programming in fixed dimensions the path coupling method for proving mixing of
Banner blindness (4,102 words) [view diff] case mismatch in snippet view article find links to article
impact than rich media with usual placement. MILP (Mixed Integer Linear Programming) approach to tackle banner blindness is based is on the hypothesis
Renata Mansini (199 words) [view diff] exact match in snippet view article find links to article
finanziari: analisi, algoritmi e risultati computazionali [mixed integer linear programming models for financial problems: analysis, algorithms, and computational
Transshipment problem (1,756 words) [view diff] case mismatch in snippet view article find links to article
Gartinkel, M. R. Rao, Nav. Res. Log. Quart. 18 (1971) 465-472 G. Hadley, Linear Programming, Addison-Wesley Publishing Company, (1962) pp. 368–373 P. L. Hammer
Network flow problem (348 words) [view diff] exact match in snippet view article find links to article
strongly polynomial The network simplex algorithm, a method based on linear programming but specialized for network flow The out-of-kilter algorithm for minimum-cost
George Nemhauser (647 words) [view diff] exact match in snippet view article find links to article
cover problem contains all the nodes that have a value of 1 in the linear programming relaxation as well as some of the nodes that have a value of 0.5.
George Nemhauser (647 words) [view diff] exact match in snippet view article find links to article
cover problem contains all the nodes that have a value of 1 in the linear programming relaxation as well as some of the nodes that have a value of 0.5.
Pivot element (1,087 words) [view diff] exact match in snippet view article find links to article
(link) Terlaky, Tamás; Zhang, Shu Zhong (1993). "Pivot rules for linear programming: A Survey on recent theoretical developments". Annals of Operations
Strength of a graph (512 words) [view diff] exact match in snippet view article find links to article
}}\forall e\in E\ \sum _{T\ni e}\lambda _{T}\leq 1\right\}.} And by linear programming duality, σ ( G ) = min { ∑ e ∈ E y e   :   ∀ e ∈ E   y e ≥ 0  and
Robert E. Machol (1,113 words) [view diff] case mismatch in snippet view article find links to article
Samuel N. Alexander (eds.) 1976, Elementary Systems Mathematics : Linear Programming for Business and the Social Sciences 1976, Management Science Applications
Vehicle rescheduling problem (427 words) [view diff] exact match in snippet view article find links to article
operations, while SDVSP and MDVSP are typically solved using long running linear programming methods. Another field where VRSP is used is in transportation of
Christian agnosticism (2,141 words) [view diff] exact match in snippet view article find links to article
quantum mechanics, ergodic theory, geometry, fluid dynamics, economics, linear programming, game theory, computer science, numerical analysis, hydrodynamics
Gaspard Monge (1,941 words) [view diff] case mismatch in snippet view article find links to article
1795. Monge's 1781 memoir is also the earliest known anticipation of Linear Programming type of problems, in particular of the transportation problem. Related
Thomson M. Whitin (508 words) [view diff] exact match in snippet view article find links to article
Economics, Nov 1952. 1953. "Classical theory, Graham's theory, and linear programming in international trade." The Quarterly Journal of Economics 67.4.
Resource leveling (581 words) [view diff] exact match in snippet view article find links to article
(help) "Rieck, J., Zimmermann, J., & Gather, T. (2012). Mixed-integer linear programming for resource leveling problems. European Journal of Operational Research
Harry Markowitz (1,745 words) [view diff] case mismatch in snippet view article find links to article
1957). "The Elimination Form of the Inverse and Its Application to Linear Programming". Management Science. 3 (3): 255–269. doi:10.1287/mnsc.3.3.255. Markowitz
Non-linear media (762 words) [view diff] exact match in snippet view article find links to article
by a television provider as an additional option on top of their linear programming. Many producers of content now offer streaming of programs through
Lagrangian relaxation (1,020 words) [view diff] exact match in snippet view article find links to article
multipliers) is the Lagrangian dual problem. Suppose we are given a linear programming problem, with x ∈ R n {\displaystyle x\in \mathbb {R} ^{n}} and A
Lynn Steen (1,330 words) [view diff] case mismatch in snippet view article find links to article
Mathematics of Elections," Scientific American 243 (October 1980) 16-26B. "Linear Programming: A Solid New Algorithm. Science News (6 Oct. 1979) 234-236. "Unsolved
Eugene Lawler (1,195 words) [view diff] exact match in snippet view article find links to article
optimization. He played a central role in rescuing the ellipsoid method for linear programming from obscurity in the West. He also wrote (with D. E. Wood) a heavily
Selmer M. Johnson (506 words) [view diff] exact match in snippet view article find links to article
Fulkerson, Johnson pioneered the use of cutting-plane methods for integer linear programming in solving the travelling salesman problem. He also made important
Restricted isometry property (859 words) [view diff] case mismatch in snippet view article find links to article
are both its special forms. E. J. Candes and T. Tao, "Decoding by Linear Programming," IEEE Trans. Inf. Th., 51(12): 4203–4215 (2005). E. J. Candes, J
Benjamin Wah (551 words) [view diff] exact match in snippet view article find links to article
Computer Science and Engineering at CUHK. Wah is an expert on non-linear programming, multimedia signal processing and artificial intelligence. He has
Decoding methods (1,852 words) [view diff] case mismatch in snippet view article find links to article
Jon; Wainwright, Martin J.; Karger, David R. (March 2005). "Using Linear Programming to Decode Binary Linear Codes". IEEE Transactions on Information Theory
Coralia Cartis (256 words) [view diff] case mismatch in snippet view article find links to article
University of Cambridge. Her dissertation, On Interior Point Methods for Linear Programming, was supervised by Michael J. D. Powell. In the same year, she was
List of NP-complete problems (2,316 words) [view diff] exact match in snippet view article find links to article
variant where variables are required to be 0 or 1, called zero-one linear programming, and several other variants are also NP-complete Latin squares (The
Arc routing (611 words) [view diff] exact match in snippet view article find links to article
points of the hull. The convex hull problem can be solved through linear programming or through convex hull algorithms, but the process of finding the
Symbolic Assembly Program (438 words) [view diff] case mismatch in snippet view article find links to article
self-loading bootstrap program. Orchard-Hays, William. "Adaptability of the Linear Programming Codes" (PDF). Defense Technical Information Center. Retrieved May
Adisa Azapagic (647 words) [view diff] exact match in snippet view article find links to article
Adisa (1996). Environmental system analysis : the application of linear programming to life cycle assessment. surrey.ac.uk (PhD thesis). University of
Additional Mathematics (1,234 words) [view diff] exact match in snippet view article find links to article
probability, probability distributions, motion along a straight line, and linear programming in Form 5, for a total of 10 chapters. Format for Additional Mathematics
Maximum cut (1,770 words) [view diff] case mismatch in snippet view article find links to article
Sudan, Madhu; Williamson, David (2000), "Gadgets, Approximation, and Linear Programming", Proceedings of the 37th IEEE Symposium on Foundations of Computer
Pathfinding (2,423 words) [view diff] exact match in snippet view article find links to article
based on reduction to other well studied problems such as integer linear programming. However, such algorithms are typically incomplete; in other words
Generalized assignment problem (1,019 words) [view diff] no match in snippet view article find links to article
The generalized assignment problem is NP-hard, However, there are linear-programming relaxations which give a ( 1 − 1 / e ) {\displaystyle (1-1/e)} -approximation
Algorithmic game theory (1,474 words) [view diff] exact match in snippet view article find links to article
contrast, correlated equilibria can be computed efficiently using linear programming, as well as learned via no-regret strategies. Computational social
Fuzzy logic (5,749 words) [view diff] exact match in snippet view article find links to article
Bhabagrahi; Lohani, A. K.; Sahu, Rohit K. (2006). "Fuzzy multiobjective and linear programming based management models for optimal land-water-crop system planning"
Odd cycle transversal (661 words) [view diff] exact match in snippet view article find links to article
S.; Saurabh, Saket (2014), "Faster parameterized algorithms using linear programming", ACM Transactions on Algorithms, 11 (2): Art. 15, 31, arXiv:1203
Multicriteria classification (1,481 words) [view diff] exact match in snippet view article find links to article
+w_{n}=1\\&&&w_{j},s_{i}^{+},s_{i}^{-},t_{r}\geq 0\end{aligned}}} This linear programming formulation can be generalized in context of additive value functions
Harvey Prize (3,033 words) [view diff] exact match in snippet view article find links to article
the solution of many previously intractable problems and has made linear programming into one of the most frequently used techniques of modern applied
Adi Ben-Israel (585 words) [view diff] exact match in snippet view article find links to article
Newton transform. Ben-Israel's research into optimization included linear programming, a Newtonian bracketing method of convex minimization, input optimization
Sudoku solving algorithms (1,706 words) [view diff] exact match in snippet view article find links to article
with Sudokus. It is also possible to express a Sudoku as an integer linear programming problem. Such approaches get close to a solution quickly, and can
Sanjiv Sidhu (389 words) [view diff] exact match in snippet view article find links to article
commercial applicability of a systematic approach to solving complex linear programming models. He was joined by Ken Sharma, formerly of the Goldratt Institute
SPECfp (766 words) [view diff] case mismatch in snippet view article find links to article
Helmholtz-type equation with non-constant coefficients. 450.soplex C++ Linear Programming, Optimization Solves a linear program using a simplex algorithm and
Harmonic grammar (873 words) [view diff] case mismatch in snippet view article find links to article
Jesney, Rajesh Bhatt and Michael Becker. (2010). Harmonic Grammar with Linear Programming: From linear systems to linguistic typology. Phonology 27: 77-117
Multi-armed bandit (6,888 words) [view diff] case mismatch in snippet view article find links to article
a simple algorithm that combines the UCB method with an Adaptive Linear Programming (ALP) algorithm, and can be easily deployed in practical systems.
University of Maryland, College Park (15,297 words) [view diff] exact match in snippet view article find links to article
won the 1975 National Medal of Science for his work in the field of linear programming. Professor of physics Michael Fisher won the Wolf Prize in 1980 (together
Diophantine equation (4,542 words) [view diff] exact match in snippet view article find links to article
substantially easier to compute than the Smith normal form." Integer linear programming amounts to finding some integer solutions (optimal in some sense)
Water supply network (3,730 words) [view diff] case mismatch in snippet view article find links to article
settings on the behavior of the network. Apart from Linear and Non-linear Programming, there are other methods and approaches to design, to manage and operate
Bell Labs (6,280 words) [view diff] exact match in snippet view article find links to article
terahertz time-domain spectroscopy. In 1984, Karmarkar's algorithm for linear programming was developed by mathematician Narendra Karmarkar. Also in 1984, a
Roy C. Geary (421 words) [view diff] case mismatch in snippet view article find links to article
Future in Figures, North Holland (1962), ASIN: B002RB858E Elements of Linear Programming with Economic Applications (with J. E. Spencer), Lubrecht & Cramer
Alligation (896 words) [view diff] case mismatch in snippet view article find links to article
ns/1-tips-on-mixtures-and-alligations/ "Alligation, Forerunner of Linear Programming", Frederick V. Waugh, Journal of Farm Economics Vol. 40, No. 1 (Feb
Pinch analysis (1,211 words) [view diff] exact match in snippet view article find links to article
algorithms. The network can be formulated as a so-called mixed integer non-linear programming (MINLP) problem and solved with an appropriate numerical solver. Nevertheless
List of phylogenetics software (1,112 words) [view diff] case mismatch in snippet view article find links to article
multi-sample cancer sequencing data. Maximum Likelihood, Integer Linear Programming (ILP) M. El-Kebir, L. Oesper, H. Acheson-Field, and B. J. Raphael
William A. Niskanen (1,512 words) [view diff] exact match in snippet view article find links to article
military efficiency. Among his accomplishments was developing a 400-line linear programming model of the Air Force transport system. His programmer for the model
BulSemCor (709 words) [view diff] exact match in snippet view article find links to article
provides greater opportunities for linguistic observations and non-linear programming (NLP) applications. Annotated items inherit the linguistic information
Circumscribed circle (4,937 words) [view diff] exact match in snippet view article find links to article
ISBN 0-471-50458-0. Megiddo, N. (1983). "Linear-time algorithms for linear programming in R3 and related problems". SIAM Journal on Computing. 12 (4): 759–776
Machtey Award (172 words) [view diff] case mismatch in snippet view article find links to article
2014 Aaron Sidford (MIT) Yin Tat Lee (MIT) "Path-Finding Methods for Linear Programming : Solving Linear Programs in Õ(√rank) Iterations and Faster Algorithms
Generalized polygon (1,424 words) [view diff] exact match in snippet view article find links to article
doi:10.1137/0605030. hdl:10338.dmlcz/102386. Nozaki, Hiroshi (2014). "Linear programming bounds for regular graphs". arXiv:1407.4562 [math.CO]. Kostochka,
Harvey M. Wagner (465 words) [view diff] case mismatch in snippet view article find links to article
of the Firm. With T.M. Whitin. Rand Corp Santa Monica Calif. 1958. Linear Programming Techniques for Regression Analysis 1960. A postscript to “Dynamic
Michel Goemans (296 words) [view diff] case mismatch in snippet view article find links to article
December 1964 (1964-12) (age 55) Scientific career Thesis Analysis of Linear Programming Relaxations for a Class of Connectivity Problems (1990) Doctoral advisor
Lenore Blum (1,369 words) [view diff] exact match in snippet view article find links to article
LP. Blum, Lenore (1988), "A new simple homotopy algorithm for linear programming. I", Journal of Complexity, 4 (2): 124–136, doi:10.1016/0885-064X(88)90025-8
Jahar Saha (400 words) [view diff] case mismatch in snippet view article find links to article
Statistics for Management (MSM). He also developed second-year courses on Linear Programming, Applications of Operations Research, Advanced Topic in Operations
Genetic algorithm (7,802 words) [view diff] exact match in snippet view article find links to article
optimization, particle swarm optimization) and methods based on integer linear programming. The suitability of genetic algorithms is dependent on the amount
Lists of Armenians (3,745 words) [view diff] exact match in snippet view article find links to article
scientist, who proved the existence of an efficient way to solve linear programming problems Semyon Davidovich Kirlian, inventor of Kirlian Photography
Khaled El Emam (561 words) [view diff] case mismatch in snippet view article find links to article
research", Am J Bioeth 2013; 13(4):42-44. H-W. Jung, K. El Emam: "A Linear Programming Model for Preserving Privacy when Disclosing Patient Spatial Information
Michael Katehakis (953 words) [view diff] exact match in snippet view article find links to article
P. Johri, in "Advances in Applied Probability",Vol. 17(2), 1985. Linear programming for finite state multi-armed bandit problems with Y.R. Chen in "Mathematics
Leonid Hurwicz (3,872 words) [view diff] exact match in snippet view article find links to article
mathematical economics. In the 1950s, he worked with Kenneth Arrow on non-linear programming; in 1972 Arrow became the youngest person to receive the Nobel Economics
Paul Samuelson (3,821 words) [view diff] case mismatch in snippet view article find links to article
387–89. doi:10.2307/1925895. JSTOR 1925895. Samuelson, Paul A. (1958), Linear Programming and Economic Analysis with Robert Dorfman and Robert M. Solow, McGraw–Hill
Meigu Guan (605 words) [view diff] case mismatch in snippet view article find links to article
Society, 1962, pp. 273–277. Guan, Meigu; Zheng, Handing (1983), 线性规划 [Linear Programming] (in Chinese), Shandong Science and Technology Press. Guan, Meigu
Convex hull algorithms (2,248 words) [view diff] exact match in snippet view article find links to article
using the technique of marriage-before-conquest and low-dimensional linear programming. Published by Kirkpatrick and Seidel in 1986. Chan's algorithm — O(n
Bilski v. Kappos (1,506 words) [view diff] exact match in snippet view article find links to article
advanced diagnostic medicine techniques, and inventions based on linear programming, data compression, and the manipulation of digital signals" but "the