Ralphs - PDFSEARCH.IO - Document Search Engine

Ralphs
Results: 100

#	Item
21	Computational Experience with Hypergraph-based Methods for Automatic Decomposition in Discrete Optimization Jiadong Wang and Ted Ralphs Department of Industrial and Systems Engineering, Lehigh University, USA Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2012-12-26 15:36:44 Applied mathematics NP-complete problems Hypergraph Mathematical optimization Decomposition method Graph partition Dantzig–Wolfe decomposition Linear programming Block matrix Mathematics Theoretical computer science Operations research
22	Decomposition and Dynamic Cut Generation in Integer Linear Programming T.K. Ralphs∗ M.V. Galati† Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:52 Relaxation Linear programming Cutting-plane method Dantzig–Wolfe decomposition Lagrangian relaxation Decomposition method Mathematical optimization Convex optimization Operations research
23	Writing and Learning: What the Students Say RalphS. Stevens III Coppin State College, Baltimore, Maryland Add to Reading List Source URL: wac.colostate.edu Language: English - Date: 2012-07-12 20:50:54 Philosophy of education Critical pedagogy Curricula Student-centred learning Writing process E-learning Teaching method Project-based learning Eleanor Duckworth Education Educational psychology Pedagogy
24	Parallel Branch, Cut, and Price for Large-Scale Discrete Optimization T. K. Ralphs∗ L. Lad´anyi† Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Parallel computing Combinatorial optimization Operations research Algorithm Mathematical logic Theoretical computer science Branch and bound Heuristic function Parallel algorithm Concurrent computing Computing Mathematics
25	Noncommercial Software for Mixed-Integer Linear Programming J. T. Linderoth∗ T. K. Ralphs† December, 2004. Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Combinatorial optimization Relaxation Linear programming Linear programming relaxation Inequality Branch and cut MINTO Algorithm Cutting-plane method Mathematical optimization Mathematics Operations research
26	Duality for Mixed-Integer Linear Programs M. Guzelsoy∗ T. K. Ralphs† Original May, 2006 Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Linear programming Convex optimization Operations research Combinatorial optimization Cutting-plane method Duality Derivative Relaxation Vector space Mathematics Mathematical optimization Mathematical analysis
27	On the Capacitated Vehicle Routing Problem∗ T.K. Ralphs†, L. Kopman‡, W.R. Pulleyblank§, and L.E. Trotter, Jr.¶ Revised December 17, 2001 Abstract We consider the Vehicle Routing Problem, in which a fixed fleet o Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Applied mathematics Convex optimization Relaxation Linear programming Travelling salesman problem Lagrangian relaxation Simplex algorithm Mathematical optimization Operations research Mathematics
28	Parallel Branch and Cut T.K. Ralphs∗ Revised January 17, 2006 Abstract We discuss the main issues that arise in parallelizing the well-known branch-andcut algorithm for solving mixed-integer linear programs. Designing Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:51 Combinatorial optimization Applied mathematics Linear programming Linear programming relaxation Algorithm Divide and conquer algorithm Heuristic function Branch and cut Branch and bound Mathematical optimization Mathematics Operations research
29	The SYMPHONY Callable Library for Mixed-Integer Linear Programming Ted Ralphs and Menal Guzelsoy Industrial and Systems Engineering Lehigh University Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:54 Mathematics Applied mathematics Linear programming Duality COIN-OR Lis Semidefinite programming Operations research Mathematical optimization Convex optimization
30	Computational Experience with Generic Decomposition using the DIP Framework M.V. Galati∗ T.K. Ralphs† Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2012-09-15 17:55:19 Relaxation Linear programming Decomposition method Dantzig–Wolfe decomposition Cutting-plane method Lagrangian relaxation Mathematical optimization Operations research Convex optimization

UPDATE