Search alternatives:
shortcut » shortcuts, shortest
shortests » shortest, hortests, shortess
Cover Image
Read Now

1
by Cutroni, Justin
Published 2007
O'Reilly
“...O'Reilly shortcuts...”
Cover Image
Read Now

2
by Hamacher, Horst W., Klamroth, Kathrin
Published 2006
Vieweg+Teubner Verlag
Table of Contents: “... -- Interior Point Methods: Karmarkar’s Projective Algorithm -- to Graph Theory and Shortest Spanning Trees...”
Cover Image
Read Now

3
by Pytlak, Radoslaw
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... Memory Quasi-Newton Algorithms -- The Method of Shortest Residuals and Nondifferentiable Optimization...”
Cover Image
Read Now

4
by Verzani, John
Published 2011
O'Reilly
Table of Contents: “...; Keyboard shortcuts; R Programming Features; Syntax highlighting; Bracket matching; Automatic indenting...”
Cover Image
Read Now

5
by Neumann, Frank, Witt, Carsten
Published 2010
Springer Berlin Heidelberg
Table of Contents: “... Matchings -- Makespan Scheduling -- Shortest Paths -- Eulerian Cycles -- Multi-objective Optimization...”
Cover Image
Read Now

6
by Sengupta, Atanu, Pal, Tapan Kumar
Published 2009
Springer Berlin Heidelberg
Table of Contents: “... Programming -- Fuzzy Preference Ordering of Intervals -- Solving the Shortest Path Problem with Interval Arcs...”
Cover Image
Read Now

7
by Du, Ding-Zhu, Pardalos, Panos M., Hu, Xiaodong, Wu, Weili
Published 2022
Springer International Publishing
Table of Contents: “...1. Introduction.-2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy...”
Cover Image
Read Now

8
by Klamroth, Kathrin
Published 2002
Springer New York
Table of Contents: “...and General Results -- Measuring Distances -- Shortest Paths in the Presence of Barriers...”
Cover Image
Read Now

9
by Kasperski, Adam
Published 2008
Springer Berlin Heidelberg
Table of Contents: “... Regret Minimum Selecting Items -- Minmax Regret Minimum Spanning Tree -- Minmax Regret Shortest Path...”
Cover Image
Read Now

10
Published 2004
Springer Berlin Heidelberg
Table of Contents: “... Problems -- Engineering Shortest Path Algorithms -- How to Tell a Good Neighborhood from a Bad One...”
Cover Image
Read Now

11
by Yarberry, William
Published 2021
Apress
Table of Contents: “... of Data -- 20: Shortcuts and Miscellaneous -- 21: Conclusion -- Appendix A: Suggested Websites -- Appendix...”
Cover Image
Read Now

12
Published 2024
Springer Nature Switzerland
Table of Contents: “... of subtrees.-Data-driven feasibility for the Resource Constraint Shortest Path Problem.-Monte-Carlo...”
Cover Image
Read Now

13
by Tsybakov, Alexandre B.
Published 2009
Springer New York
“... form but rather under assumptions that lead to shorter or more elegant proofs. The book has three...”
Cover Image
Read Now

14
Published 2011
Springer US
Table of Contents: “... and Comparison Results: The Markov Reward Approach For Queueing Networks -- Stability of join-the-shortest-queue...”
Cover Image
Read Now

15
Published 1996
Springer New York
Table of Contents: “... -- 9 Overloading Parallel Servers When Arrivals Join The Shortest Queue -- 10 Rare Events...”
Cover Image
Read Now

16
Published 1996
Springer Berlin Heidelberg
Table of Contents: “... for the shortest common superstring that are asymtotically optimal -- On the depth of randomly generated circuits --...”
Cover Image
Read Now

17
by Kollo, Tõnu, Rosen, D. von
Published 2005
Springer Netherlands
“.... On the other hand, it can be used as material for series of shorter courses. In fact, Chapters 1 and 2 have...”
Cover Image
Read Now

18
by Kolman, Bernard
Published 1995
Academic Press
Table of Contents: “.... The Shortest Route Problem. The Critical Path Method. Computer Aspects. Appendices: Karmarkar's Algorithm...”
Cover Image
Read Now

19
by Wallace, C.S.
Published 2005
Springer New York
“... for the implementation of Occam's Razor, asserts that the ‘best’ explanation of observed data is the shortest. Further...”
Cover Image
Read Now

20
by Brockwell, Peter J., Davis, Richard A.
Published 1991
Springer New York
“... (including applications of the Kalman recursions to missing-value problems) and shorter accounts of special...”