Discrete optimization is a branch of optimization in applied mathematics and computer science. In mathematics, optimization is the discipline which is concerned with finding the maxima and minima of functions, possibly subject to constraints. ... Applied mathematics is a branch of mathematics that concerns itself with the application of mathematical knowledge to other domains. ... Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Categories: Computer science ...
As opposed to continuous optimization, the variables used in the objective function (or some of them) are restricted to assume only discrete values, such as the integers. Continuous optimization is a branch of optimization in applied mathematics. ... Jump to: navigation, search In computer science and mathematics, a variable is a symbol denoting a quantity or symbolic representation. ... Jump to: navigation, search In mathematics, the term optimization refers to the study of problems that have the form Given: a function f : A R from some set A to the real numbers Sought: an element x0 in A such that f(x0) ≤ f(x) for all x in A... The word discrete comes from the Latin word discretus which means separate. ...
Problems of combinatorial optimization can be formulated in terms of discrete optimization, however methods of their solution are often different. Combinatorial optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory. ...
DiscreteOptimization - book by Boros, E.;Hammer, P.L. The book entitled: "DiscreteOptimization" is in the Discrete Mathematics and Combinatorics Books section of Mathematics Books area...
This volume is an update on the impressive progress achieved by mathematicians, operations researchers, and computer scientists in solving discreteoptimization problems of very large sizes.
Discrete location problems with push-pull objectives (J. Krarup, D. Pisinger, F. Plastria).
DiscreteOptimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization.
In addition to reports on mathematical results pertinent to discreteoptimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications).
Manuscripts submitted for possible publication to DiscreteOptimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.
Feeds |
Contact