Open AccessBook
Mathematical programming
Michael J. Todd
- pp 711-731
About:
The article was published on 1997-01-01 and is currently open access. It has received 437 citations till now.read more
Citations
More filters
Book
How to Solve It: Modern Heuristics
TL;DR: In this article, the authors present a set of heuristics for solving problems with probability and statistics, including the Traveling Salesman Problem and the Problem of Who Owns the Zebra.
Journal ArticleDOI
Second-order cone programming
Farid Alizadeh,Donald Goldfarb +1 more
TL;DR: SOCP formulations are given for four examples: the convex quadratically constrained quadratic programming (QCQP) problem, problems involving fractional quadRatic functions, and many of the problems presented in the survey paper of Vandenberghe and Boyd as examples of SDPs can in fact be formulated as SOCPs and should be solved as such.
Book
Routing, Flow, And Capacity Design In Communication And Computer Networks
Michal Pioro,Deepankar Medhi +1 more
TL;DR: Throughout, the authors focus on the traffic demands encountered in the real world of network design, and their generic approach allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network.
Proceedings ArticleDOI
Optimal Step Nonrigid ICP Algorithms for Surface Registration
TL;DR: An algorithm using a locally affine regularisation which assigns an affine transformation to each vertex and minimises the difference in the transformation of neighbouring vertices is presented, showing that for this regularisation the optimal deformation for fixed correspondences and fixed stiffness can be determined exactly and efficiently.
Book
Linear Programming 1: Introduction
TL;DR: Encompassing all the major topics students will encounter in courses on the subject, the authors teach both the underlying mathematical foundations and how these ideas are implemented in practice, making this an ideal textbook for all those coming to the subject for the first time.
References
More filters
Book
How to Solve It: Modern Heuristics
TL;DR: In this article, the authors present a set of heuristics for solving problems with probability and statistics, including the Traveling Salesman Problem and the Problem of Who Owns the Zebra.
Journal ArticleDOI
Second-order cone programming
Farid Alizadeh,Donald Goldfarb +1 more
TL;DR: SOCP formulations are given for four examples: the convex quadratically constrained quadratic programming (QCQP) problem, problems involving fractional quadRatic functions, and many of the problems presented in the survey paper of Vandenberghe and Boyd as examples of SDPs can in fact be formulated as SOCPs and should be solved as such.
Book
Routing, Flow, And Capacity Design In Communication And Computer Networks
Michal Pioro,Deepankar Medhi +1 more
TL;DR: Throughout, the authors focus on the traffic demands encountered in the real world of network design, and their generic approach allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network.
Proceedings ArticleDOI
Optimal Step Nonrigid ICP Algorithms for Surface Registration
TL;DR: An algorithm using a locally affine regularisation which assigns an affine transformation to each vertex and minimises the difference in the transformation of neighbouring vertices is presented, showing that for this regularisation the optimal deformation for fixed correspondences and fixed stiffness can be determined exactly and efficiently.
Book
Linear Programming 1: Introduction
TL;DR: Encompassing all the major topics students will encounter in courses on the subject, the authors teach both the underlying mathematical foundations and how these ideas are implemented in practice, making this an ideal textbook for all those coming to the subject for the first time.