<--- Back to Details
First PageDocument Content
Operations research / Dynamic programming / Cryptography / Combinatorial optimization / Knapsack problem / Subset sum problem / Sequence / Exponentiation / Linear programming / Mathematics / Theoretical computer science / Computational complexity theory
Date: 2015-06-24 05:21:38
Operations research
Dynamic programming
Cryptography
Combinatorial optimization
Knapsack problem
Subset sum problem
Sequence
Exponentiation
Linear programming
Mathematics
Theoretical computer science
Computational complexity theory

Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team

Add to Reading List

Source URL: doc.sagemath.org

Download Document from Source Website

File Size: 598,79 KB

Share Document on Facebook

Similar Documents

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem  Nabil Abdennadher

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher

DocID: 1xTOs - View Document

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

DocID: 1vqMk - View Document

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore   Rahul Jain*

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain*

DocID: 1vouJ - View Document

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

DocID: 1vhRF - View Document

EE365: Deterministic Finite State Control  Deterministic optimal control Shortest path problem Dynamic programming Examples

EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

DocID: 1vg0M - View Document