Recent Developments in the Gurobi Optimizer
|
|
- Collin Bennett
- 5 years ago
- Views:
Transcription
1 Recent Developments in the Gurobi Optimizer
2 Overview Introduction (10 minutes) Ed Rothberg Gurobi 7.5 and 8.0 (15 minutes) Ed Rothberg Improvements in Compute Server and Instant Cloud (30 minutes) Michel Jaczynski MIP is not an Algorithm (30 minutes) Ed Rothberg Performance Improvements (10 minutes) Ed Rothberg Wrap-up and Q&A Copyright 2018, Gurobi Optimization, LLC 2
3 A Few Facts Founded July 2008 Zonghao Gu, Ed Rothberg, Bob Bixby Focused exclusively on math programming No competing priorities The Gurobi team 27 strong ~50% development and support ~50% have PhD s History of continuing, significant performance improvements ~2X average improvement with each major release 92x cumulative improvement since first version in 2009 Copyright 2018, Gurobi Optimization, LLC 3
4 Recent News Copyright 2018, Gurobi Optimization, LLC 4
5 What Does It Mean? No change in focus Optimization is our sole focus Broader community is taking notice of Operations Research More resources Additional employees Greater investment in R&D More outreach to people who aren t aware of the benefits of optimization Advice from business experts Company better able to push the market and the technology forward Copyright 2018, Gurobi Optimization, LLC 5
6 New Gurobi team members in 2018 Miranda Gould Licensing Admin KJ Gundersen VP of Finance Robert Luce Developer Duke Perrucci Chief Revenue Officer Mark Reynaud US Central Sales Pano Santos Sr. Technical Content Manager Isela Warner Director of Marketing Copyright 2018, Gurobi Optimization, LLC Yuriy Zinchenko Support Engineer
7 Why Do Companies Choose Gurobi? Technology Leadership The most experienced development team focused 100% on delivering the best solver and user experience Outstanding Support Direct access to PhD-level optimization experts for fast answers to your questions No Surprises Flexible licensing and straightforward pricing to meet a full range of business situations Copyright 2018, Gurobi Optimization, LLC 7
8 Over 1,600 companies have made Gurobi their solver of choice
9 Strong track record of innovation Commercial First cloud offering Client-server support Distributed algorithms Academic Free academic licenses Free site licenses Free online-course licenses Free distributed optimization Take Gurobi with You program Copyright 2018, Gurobi Optimization, LLC 9
10 Gurobi Products Overview Gurobi Solvers Mixed-Integer Programming (MIP, MIQP, MIQCP) Deterministic, parallel Linear and Quadratic Programming Dual and primal simplex; Parallel Barrier Piecewise-linear simplex Second-Order Cone Programming Parallel Barrier APIs Simple command-line interface Python interactive interface Python modeling interface C, C++, Java,.NET, Python programming interfaces R and MATLAB matrix interfaces All standard modeling languages Extensions Piecewise-linear objectives General constraints Multi-objective optimization Commercial and Academic Licenses Licensing options and pricing available at Gurobi Compute Server Cloud offering Gurobi Instant Cloud Gurobi Cloud for AWS Perpetual licenses cloud deployable Copyright 2018, Gurobi Optimization, LLC 10
11 Gurobi 7.5 and 8.0 Dr. Edward Rothberg Copyright 2018, Gurobi Optimization, LLC 11
12 What's New? New features in Gurobi 7.5 (highlights) Improved Python interface Multi-objective improvements JavaDoc documentation New features in Gurobi 8.0 Significant enhancements to Compute Server and Instant Cloud Enhanced MATLAB and R interfaces Support for MATLAB problem-based modeling Partition heuristic Multiple MIP starts Support for.net Core 2.0 Performance improvements Copyright 2018, Gurobi Optimization, LLC 12
13 Python Modeling Enhancements Copyright 2018, Gurobi Optimization, LLC 13
14 Python Modeling With Gurobi Gurobi Python modeling interface provides the best of both worlds Convenient, expressive mathematical modeling constructs Within a widely-used, well-designed, well-supported programming language Simple constructs for creating variables, building linear expressions, adding constraints, etc. m.addconstrs(outflow[city] == transport.sum(city, '*') for city in Cities)
15 Supporting More Constraint Types More concise constraint declarations Old: model.addrange( x+y, 1.0, 2.0, c2 ) model.addgenconstrindicator( x, True, y+z == 1.0, c3 ) model.addgenconstrmax( x, [y,z], 2.0, c4 ) New: model.addconstr( x+y == [1.0,2.0], c2 ) model.addconstr((x == 1) >> (y+z == 1.0), c3 ) model.addconstr( x == max_(y,z,2.0), c4 ) Can be used in model.addconstrs() as well Copyright 2018, Gurobi Optimization, LLC 15
16 Enhanced Multi-Objective API Copyright 2018, Gurobi Optimization, LLC 16
17 Enhanced Multi-Objective API Easier definition of multiple objectives We introduced model.setobjectiven(linexpr, index,...) Old (Gurobi 7.0): coef1 = [0, 1, 2, 3, 4] coef2 = [4, 3, 2, 1, 0] x = model.addvars(5) model.numobj = 2 model.params.objnumber = 0 model.objnpriority = 2 model.objnweight = 1 model.setattr(grb.attr.objn, x, coef1) model.params.objnumber = 1 model.objnpriority = 1 model.objnweight = 1 model.setattr(grb.attr.objn, x, coef2) New (Gurobi 7.5): x = model.addvars(5) model.setobjectiven(x[1]+2*x[2]+3*x[3]+4*x[4], 0, priority=2, weight=1) model.setobjectiven(4*x[0]+3*x[1]+2*x[2]+x[3], 1, priority=1, weight=1) Copyright 2018, Gurobi Optimization, LLC 17
18 Enhanced MATLAB and R interfaces Copyright 2018, Gurobi Optimization, LLC 18
19 Completing the MATLAB and R Interfaces Previously missing features: Multi-objective optimization General constraints Several other (smaller) features Now available in MATLAB and R Also now available: Full set of Gurobi examples for MATLAB and R Copyright 2018, Gurobi Optimization, LLC 19
20 MATLAB Problem-Based Modeling Problem-based modeling: new feature in MATLAB 2017b Optimization Toolbox A more structured approach to building an optimization model x = optimvar('x', 'Type','integer','LowerBound',0,'UpperBound',1); y = optimvar('y', 'Type','integer','LowerBound',0,'UpperBound',1); z = optimvar('z', 'Type','integer','LowerBound',0,'UpperBound',1); prob = optimproblem('objectivesense','maximize'); prob.objective = x + y + 2 * z; prob.constraints.cons1 = x + 2 * y + 3 * z <= 4; prob.constraints.cons2 = x + y >= 1; sol = solve(prob, options) You can now call Gurobi through the MATLAB solve() function Copyright 2018, Gurobi Optimization, LLC 20
21 Partition Heuristic Copyright 2018, Gurobi Optimization, LLC 21
22 User-Specified Local Improvement Heuristic RINS is our most effective heuristic It is a sub-mip heuristic: Fix a subset of the variables to incumbent values Solve the resulting MIP (recursively) Reoptimizes over just that portion of the problem Sub-MIP heuristics extremely effective in general How to choose the sub-problem to reoptimize? RINS chooses automatically New feature allows user to make the choice Example sub-problems: All decisions related to a single time period All decisions related to a single machine All decisions related to physical sub-regions (e.g., Western US, Eastern US, etc.) Copyright 2018, Gurobi Optimization, LLC 22
23 Multiple MIP Starts Copyright 2018, Gurobi Optimization, LLC 23
24 Multiple MIP Starts User can now provide multiple MIP starts Useful when you have multiple partial solutions MIP solver will try to complete them, and will store the ones it finds For distributed MIP, MIP starts will be evaluated on different machines Copyright 2018, Gurobi Optimization, LLC 24
25 .NET Core 2.0 Copyright 2018, Gurobi Optimization, LLC 25
26 .NET Core 2.0 Gurobi users can now write.net programs that run on Windows, Linux, and Mac Using new Microsoft.NET Core 2.0 Copyright 2018, Gurobi Optimization, LLC 26
27 Compute Server and Instant Cloud Dr. Michel Jaczynski Copyright 2018, Gurobi Optimization, LLC 27
28 Compute Server Overview Client Queuing Load Balancing Remote Services Seamlessly offload optimization jobs to one or more servers Common use cases: Access more powerful machines Share resources across users, teams and applications Ensure high-availability with multiple nodes Build modern microservice architectures 2018 Gurobi Optimization
29 Improved Compute Server Architecture Client Remote Services (grb_rs) Remote Services (grb_rs) HTTP/HTTPS Remote Services (grb_rs) Join/leave Communication using HTTP or secured HTTPS Easier integration with firewalls and proxies Standard security and data encryption Better robustness to handle intermittent network issues Remote Services (grb_rs) Clustering Nodes can join or leave the cluster dynamically Jobs are load-balanced on the different nodes Client can connect to any node in the cluster 2018 Gurobi Optimization
30 Setting up the Cluster New Packaging New separated server package (grb_rs and server tools) New Remote Services Reference Manual Configure nodes Set configuration properties in grb_rs.cnf file Configure protocol (HTTP, HTTPS) and port (80, 443, or other) How to get help? $ grb_rs --help $ grb_rs properties Start the Remote Services Agent (grb_rs) as a service (Linux, Mac, Windows) $ grb_rs start 2018 Gurobi Optimization
31 New Command Line Tool grbcluster (1/3) Getting help? $ grbcluster --help $ grbcluster <command> --help Submit jobs using libraries or gurobi_cl $ gurobi_cl --server=server1 glass4.mps Compute Server job ID: d933fff7-ac0b-41a c4d92b4395 Capacity available on server1' - connecting... Established HTTP unencrypted connection [ ] List cluster status: grbcluster nodes $ grbcluster --server=server1 nodes ADDRESS STATUS TYPE LICENSE #Q #R JL IDLE %MEM %CPU server1 ALIVE COMPUTE VALID m server2 ALIVE COMPUTE VALID m List running and queued jobs: grbcluster jobs $ grbcluster --server=server1 jobs JOBID ADDRESS STATUS #Q STIME USER PRIO d933fff7 server1 RUNNING :40:37 user Gurobi Optimization
32 New Command Line Tool grbcluster (2/3) List recently processed jobs: grbcluster recent $ grbcluster --server=server1 recent JOBID ADDRESS STATUS STIME USER OPT API 8a8cd65e server1 COMPLETED :44:54 user1 OPTIMAL Python ecfabdeb server2 COMPLETED :05:25 user1 INFEASIBLE Java fe60d00b server1 IDLETIMEOUT :01:35 user1 OPTIMAL Python 977eb86d server2 DISCONNECTED :51:49 user1 Display job log: grbcluster log <JOBID> $ grbcluster --server=server1 log MIR: 3 Flow cover: 43 Explored nodes ( simplex iterations) in seconds Thread count was 2 (of 2 available processors) Solution count 10: e e e e+09 Optimal solution found (tolerance 1.00e-04) Display job parameters: grbcluster params <JOBID> $ gurobi_cl --server=server1 TimeLimit=120 glass4.mps $ grbcluster --server=server1 params e88a496f TimeLimit= Gurobi Optimization
33 New Command Line Tool grbcluster (3/3) List licenses: grbcluster licenses $ grbcluster --server=server1 --password=admin licenses ADDRESS STATUS TYPE KEY EXP ORG USER APP VER CS DL ERROR server1 VALID NODE Gurobi Inc. 8 true 100 server2 VALID NODE Gurobi Inc. 8 true 100 Abort jobs: grbcluster abort <JOBID> $ grbcluster --server=server1 --password=admin abort 8f9b15d9 $ grbcluster --server=server1 recent JOBID ADDRESS STATUS STIME USER 8f9b15d9 server1 ABORTED :41:33 user1 Change some configuration parameters: grbcluster config $ grbcluster --server=server1 --password=admin config --job-limit=4 $ grbcluster --server=server1 nodes ADDRESS STATUS TYPE LICENSE #Q #R JL IDLE %MEM %CPU server1 ALIVE COMPUTE VALID m server2 ALIVE COMPUTE VALID m Gurobi Optimization
34 New REST API Programmatically monitor and manage your cluster Monitor cluster nodes, jobs, licenses Abort jobs 2018 Gurobi Optimization
35 Instant Cloud Overview Automated Provisioning Cloud Manager Client Queuing Load Balancing Remote Services Dedicated Cloud Machines Seamlessly offload optimization jobs to the cloud Common use cases: Solve challenging models Spikes in demand Periodic optimization needs Cloud-based solution Cloud-based failover 2018 Gurobi Optimization
36 Instant Cloud Manager (cloud.gurobi.com) Download license files Customize machine Pools Region: N. Virginia, N. California, Frankfurt, Tokyo, Sydney Machine type, up to 32 cores and 244GB memory Number of servers Monitor machines and jobs 2018 Gurobi Optimization
37 Improved Architecture Automated Provisioning Cloud Manager Client Remote Services Dedicated Cloud Machines HTTPS Communication using secured HTTPS Easier integration with firewalls and proxies (no custom port to open) Standard security and data encryption (certificate validation, TLS encryption) Better robustness to handle intermittent network issues (retry and reconnect) 2018 Gurobi Optimization
38 New Job List 3 categories: Main jobs Worker jobs (sub-jobs submitted for distributed optimization or tuning) Queued job Jobs can be aborted Includes recently processed jobs (completed, failed, aborted) 2018 Gurobi Optimization
39 New Job Dashboard Access to model information, parameters, charts and log Gurobi Optimization
40 New Job History Optional feature, keep history over the last 90 days: Display Job status, metadata Download log file 2018 Gurobi Optimization
41 New Machine Usage Metrics Monitor machine CPU and memory usage 2018 Gurobi Optimization
42 New Pool Scaling Scaling up: Start additional machines that will take jobs from the queue Scaling down: Remove machines from the pool, drain existing jobs that are already running 2018 Gurobi Optimization
43 Extended REST API Programmatically monitor and manage your cloud machines New APIs for jobs and pool scaling 2018 Gurobi Optimization
44 MIP is not an Algorithm Dr. Ed Rothberg Copyright 2018, Gurobi Optimization, LLC 44
45 MIP is not an Algorithm MIP is typically thought of as an algorithm Relaxation-based branch-and-bound A limiting point of view Better to think of it as a declarative framework for stating optimization problems Backed by a rich mathematical foundation Linear programming, duality, polyhedral theory, etc. Allows for a variety of algorithms to be applied A giant bag of tricks Applied systematically and automatically Only when considered together do you get a robust and efficient method Copyright 2018, Gurobi Optimization, LLC 45
46 Customer Applications of MIP ( ) Accounting Advertising Agriculture Airlines ATM provisioning Compilers Defense Electrical power Energy Finance Food service Forestry Gas distribution Government Internet applications Logistics/supply chain Medical Mining National research labs Online dating Portfolio management Railways Recycling Revenue management Semiconductor Shipping Social networking Sourcing Sports betting Sports scheduling Statistics Steel Manufacturing Telecommunications Transportation Utilities Workforce Management Copyright 2018, Gurobi Optimization, LLC 46
47 Expressiveness Versus Tractability
48 Problem and Algorithms Trade-off between expressiveness and tractability Efficient algorithms for very specific problems Tractability Expressiveness State problems you can t solve Copyright 2018, Gurobi Optimization, LLC 48
49 A Few Examples Graph algorithms Regression Linear systems of equations Tractability SAT Expressiveness Constraint programming Non-linear programming Copyright 2018, Gurobi Optimization, LLC 49
50 A Few Examples Graph algorithms Regression Linear systems of equations Tractability SAT MIP Expressiveness Constraint programming Non-linear programming Copyright 2018, Gurobi Optimization, LLC 50
51 Important Properties of MIP Declarative No need to rewrite algorithm to accommodate additional constraints Expressive Adding side constraints typically leaves the problem type unchanged Regular problem structure (Ax=b) Allows for fairly simple recognition of useful/special structure Copyright 2018, Gurobi Optimization, LLC 51
52 MIP Improvements and Where They Come From
53 MIP Improvements in Gurobi 7.5 (by Category) Presolve - 7.8% 8 improvements, largest 2.0% Node presolve - 4.2% 5 improvements, largest 1.3% Symmetry - 7.0% 3 improvements, largest 3.1% LP % Many small improvements Cutting planes % 6 improvements, largest 6.3% Branching - 2.8% Heuristics - 4.6% 5 improvements, largest 1.4% Copyright 2018, Gurobi Optimization, LLC 53
54 Opening the Bag of Tricks MIP draws from many different disciplines A few examples: Graph algorithms: Bi-connected components Number theory Modular multiplicative inverse Meta-heuristics Relaxation Induced Neighborhood Search (RINS) Copyright 2018, Gurobi Optimization, LLC 54
55 Bi-Connected Components
56 Disconnected Components A = As a single model, runtime grows as #nodes n for n components When split, runtime grows as #nodes*n Copyright 2018, Gurobi Optimization, LLC 56
57 Nearly Disconnected Components A = Identify variables that disconnect the model to create disconnect components Copyright 2018, Gurobi Optimization, LLC 57
58 Identifying Variables that Disconnect the Model Problem is equivalent to finding a vertex separator in the intersection graph of A Intersection graph: One node for each variable An edge (i,j) whenever variables i and j ever appear in the same constraint Vertex separator A set of vertices whose removal disconnects the graph Copyright 2018, Gurobi Optimization, LLC 58
59 Intersection Graph V1 V2 S No edges between vertices in V1 and V2 implies No pair of variables in V1 and V2 participate in the same constraint Copyright 2018, Gurobi Optimization, LLC 59
60 Bi-Connected Components Articulation point Identify a single vertex that disconnects the graph Algorithm by Lipton and Tarjan Linear time in # of edges in graph Identifies all vertices that disconnect graph V1 V2 S Copyright 2018, Gurobi Optimization, LLC 60
61 Bi-Connected Components Articulation point If articulation point is a binary variable Fix variable to 1 solve remaining pieces independently Fix variable to 0 Exploits bi-connected structure to create disconnected components Often much faster than solving whole problem V1 V2 S Copyright 2018, Gurobi Optimization, LLC 61
62 Number Theory Copyright 2018, Gurobi Optimization, LLC
63 Modular Inverse Reduction Consider a x + b y = c (possibly after aggregation) x, y are integer variables a, b and c are integers, a > 1 Assume GCD(a,b) = 1 Divide through by GCD otherwise Compute modular multiplicative inverse of a Integer m such that a m = 1 (mod b) Computed using extended Euclidean algorithm Transformation a x + b y = c m a x + m b y = m c x = m c (mod b) Copyright 2018, Gurobi Optimization, LLC 63
64 Modular Inverse Reduction - Example 5 x x x x 4 = 31 (all integer variables) Substitute y = x x x 4 5 y + 3 x 3 = 31 Modular inverse of 3 mod 5 is 2 (2 * 3 = 1 (mod 5)) 10 y + 6 x 3 = 62 (mod 5) x 3 = 2 (mod 5) x 3 = { 2, 7, 12, 17, } Exploiting this observation In MIP search tree, if x 3 = 3.5 in relaxation Normal branch: x <= 3 or x >= 4 Better branch: x <= 2 or x >= 7 Impact Runtime drops from s to 0.01s for one family of models Often a significant win when it can be applied Copyright 2018, Gurobi Optimization, LLC 64
65 Meta-Heuristics Copyright 2018, Gurobi Optimization, LLC
66 Sub-MIP Heuristics Meta-heuristics play a big role in MIP Basic structure: local search through sub-mips Fix a set of variables Solve a MIP on the remainder Recursive (sub-mips explored in remainder model too) A form of Very Large Neighborhood Search (VLNS) Population-based meta-heuristics MIP tree search naturally finds multiple solutions Can use approaches that combine solutions Most effective meta-heuristic in MIP: Relaxation Induced Neighborhood Search (RINS) Copyright 2018, Gurobi Optimization, LLC 66
67 Relaxation Induced Neighborhood Search A population of two Current incumbent solution integer feasible but (probably) not optimal Current relaxation solution optimal but not integer feasible Simple sub-mip Fix variables that agree in two solutions Diversified Different relaxation at each branch-and-bound node Adaptive Neighborhood is large when optimality gap is large, small when gap is small Often the best approach to find a good solution is Find a bad solution and improve it Copyright 2018, Gurobi Optimization, LLC 67
68 Meta-meta-heuristics Feed domain-specific heuristic solutions to MIP solver MIP solver works to improve those solutions Systematic exploration of space, using cutoff from provided solution Additional input to MIP meta-heuristics Copyright 2018, Gurobi Optimization, LLC 68
69 Conclusions Copyright 2018, Gurobi Optimization, LLC
70 Always Try MIP Copyright 2018, Gurobi Optimization, LLC 70
71 Gurobi 8.0 Performance Improvements Dr. Ed Rothberg Copyright 2018, Gurobi Optimization, LLC 71
72 Two Kinds of Benchmarks Internal benchmarks Most important: compare Gurobi version-over-version Based on internal library of 4538 models External, competitive benchmarks Conducted by Hans Mittelmann, Arizona State University For MIP largely based upon MIPLIB 2010 Copyright 2018, Gurobi Optimization, LLC 72
73 Internal Benchmarks Copyright 2018, Gurobi Optimization, LLC 73
74 Gurobi MIP Library 1E+09 (4538 models) ,000,000 Columns , Rows Copyright 2018, Gurobi Optimization, LLC 74
75 Performance Improvements: 7.5 to 8.0 Problem Class >1s >100s # Wins Losses Speedup # Wins Losses Speedup LP: concur x x primal x x dual x x barrier x x MIP x x MIQP x x MIQCP x x Gurobi 7.5 vs. 8.0: > 1.00x means that Gurobi 8.0 is faster than Gurobi 7.5 Copyright 2018, Gurobi Optimization, LLC 75
76 Performance Improvements: 7.0 to 8.0 Problem Class >1s >100s # Wins Losses Speedup # Wins Losses Speedup LP: concur x x primal x x dual x x barrier x x MIP x x MIQP x x MIQCP x x Gurobi 7.0 vs. 8.0: > 1.00x means that Gurobi 8.0 is faster than Gurobi 7.0 Copyright 2018, Gurobi Optimization, LLC 76
77 Continual Performance Improvements Nearly a 2x average improvement per major release 3.00 V-V Speedup Cumulative Speedup 90.0 ~92x improvement (8+ years) Version-to-Version Speedup Cummulative Speedup > > > > > > > 8.0* - Time limit: sec. Intel Xeon CPU E GHz 4 cores, 8 hyper-threads 32 GB RAM Gurobi Version-to-Version Pairs MIP test set has 3740 models: discarded due to inconsistent answers discarded that none of the versions can solve - speed-up measured on >100s bracket: 1227 models Copyright 2018, Gurobi Optimization, LLC 77
78 Wrap-Up and Q&A Copyright 2018, Gurobi Optimization, LLC 78
79 While You re At INFORMS Software Tutorial: Gurobi Compute Server and Instant Cloud Dr. Michel Jaczynski Monday, 11:30am 12:20pm Falkland Drop by the Gurobi Booth #28 at the Exhibit Hall Copyright 2018, Gurobi Optimization, LLC 79
80 We're Hiring Support Engineer Worldwide Stop by our booth or visit our website for more information Copyright 2018, Gurobi Optimization, LLC 80
81 Thank You Questions?
Welcome to the Webinar. What s New in Gurobi 7.5
Welcome to the Webinar What s New in Gurobi 7.5 Speaker Introduction Dr. Tobias Achterberg Director of R&D at Gurobi Optimization Formerly a developer at ILOG, where he worked on CPLEX 11.0 to 12.6 Obtained
More informationWhat's New in Gurobi 7.0
What's New in Gurobi 7.0 What's New? New employees New features in 7.0 Major and minor Performance improvements New Gurobi Instant Cloud 2 The newest members of the Gurobi team Daniel Espinoza Senior Developer
More informationThe Gurobi Optimizer. Bob Bixby
The Gurobi Optimizer Bob Bixby Outline Gurobi Introduction Company Products Benchmarks Gurobi Technology Rethinking MIP MIP as a bag of tricks 8-Jul-11 2010 Gurobi Optimization 2 Gurobi Optimization Incorporated
More informationParallel and Distributed Optimization with Gurobi Optimizer
Parallel and Distributed Optimization with Gurobi Optimizer Our Presenter Dr. Tobias Achterberg Developer, Gurobi Optimization 2 Parallel & Distributed Optimization 3 Terminology for this presentation
More informationThe Gurobi Solver V1.0
The Gurobi Solver V1.0 Robert E. Bixby Gurobi Optimization & Rice University Ed Rothberg, Zonghao Gu Gurobi Optimization 1 1 Oct 09 Overview Background Rethinking the MIP solver Introduction Tree of Trees
More informationUsing Multiple Machines to Solve Models Faster with Gurobi 6.0
Using Multiple Machines to Solve Models Faster with Gurobi 6.0 Distributed Algorithms in Gurobi 6.0 Gurobi 6.0 includes 3 distributed algorithms Distributed concurrent LP (new in 6.0) MIP Distributed MIP
More informationGUROBI OPTIMIZER REMOTE SERVICES MANUAL. Version 8.0, Copyright c 2018, Gurobi Optimization, LLC
GUROBI OPTIMIZER REMOTE SERVICES MANUAL Version 8.0, Copyright c 2018, Gurobi Optimization, LLC Contents 1 Introduction 4 2 Gurobi Compute Server and Remote Services Overview 5 2.1 Compute Server.......................................
More informationExploiting Degeneracy in MIP
Exploiting Degeneracy in MIP Tobias Achterberg 9 January 2018 Aussois Performance Impact in Gurobi 7.5+ 35% 32.0% 30% 25% 20% 15% 14.6% 10% 5.7% 7.9% 6.6% 5% 0% 2.9% 1.2% 0.1% 2.6% 2.6% Time limit: 10000
More informationMotivation for Heuristics
MIP Heuristics 1 Motivation for Heuristics Why not wait for branching? Produce feasible solutions as quickly as possible Often satisfies user demands Avoid exploring unproductive sub trees Better reduced
More informationMajor New Features in Gurobi 7.0
Advanced Models Major New Features in Gurobi 7.0 Python modeling enhancements Much more direct mapping from mathematical notation to code General constraints Shorthand for modeling common logical constraints
More informationWhat's New In Gurobi 5.0. Dr. Edward Rothberg
What's New In Gurobi 5.0 Dr. Edward Rothberg Our Main Goals for Gurobi 5.0 Expand the reach of the product: New problem types: Quadratic constraints: QCP, SOCP, MIQCP Massive numbers of constraints: Through
More informationHeuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX)
Andrea Tramontani CPLEX Optimization, IBM CWI, Amsterdam, June 12, 2018 Heuristics in Commercial MIP Solvers Part I (Heuristics in IBM CPLEX) Agenda CPLEX Branch-and-Bound (B&B) Primal heuristics in CPLEX
More informationSolving a Challenging Quadratic 3D Assignment Problem
Solving a Challenging Quadratic 3D Assignment Problem Hans Mittelmann Arizona State University Domenico Salvagnin DEI - University of Padova Quadratic 3D Assignment Problem Quadratic 3D Assignment Problem
More informationThe Heuristic (Dark) Side of MIP Solvers. Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL
The Heuristic (Dark) Side of MIP Solvers Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL 1 Table of content [Lodi], The Heuristic (Dark) Side of MIP Solvers, Hybrid Metaheuristics, 273-284,
More informationWhat s New in CPLEX Optimization Studio ?
Mary Fenelon Manager, CPLEX Optimization Studio Development What s New in CPLEX Optimization Studio 12.6.1? Agenda IBM Decision Optimization portfolio CPLEX Optimization Studio OPL and the IDE CPLEX CP
More informationTopics. Introduction. Specific tuning/troubleshooting topics "It crashed" Gurobi parameters The tuning tool. LP tuning. MIP tuning
Tuning II Topics Introduction Gurobi parameters The tuning tool Specific tuning/troubleshooting topics "It crashed" The importance of being specific LP tuning The importance of scaling MIP tuning Performance
More informationAn Introduction to ODH CPLEX. Alkis Vazacopoulos Robert Ashford Optimization Direct Inc. April 2018
An Introduction to ODH CPLEX Alkis Vazacopoulos Robert Ashford Optimization Direct Inc. April 2018 Summary New features Challenges of Large Scale Optimization The ODHeuristics approach ODHeuristics Engine
More informationState-of-the-Optimization using Xpress-MP v2006
State-of-the-Optimization using Xpress-MP v2006 INFORMS Annual Meeting Pittsburgh, USA November 5 8, 2006 by Alkis Vazacopoulos Outline LP benchmarks Xpress performance on MIPLIB 2003 Conclusions 3 Barrier
More informationUsing ODHeuristics To Solve Hard Mixed Integer Programming Problems. Alkis Vazacopoulos Robert Ashford Optimization Direct Inc.
Using ODHeuristics To Solve Hard Mixed Integer Programming Problems Alkis Vazacopoulos Robert Ashford Optimization Direct Inc. February 2017 Summary Challenges of Large Scale Optimization Exploiting parallel
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationAlgorithms II MIP Details
Algorithms II MIP Details What s Inside Gurobi Optimizer Algorithms for continuous optimization Algorithms for discrete optimization Automatic presolve for both LP and MIP Algorithms to analyze infeasible
More informationGurobi Guidelines for Numerical Issues February 2017
Gurobi Guidelines for Numerical Issues February 2017 Background Models with numerical issues can lead to undesirable results: slow performance, wrong answers or inconsistent behavior. When solving a model
More informationGurobi Implementation
Gurobi Implementation Outlines Introduction Installing Gurobi Creating a visual studio C++ project for Groubi Building and solving Gurobi model page: 2 Introduction (1/4) Gurobi is a state-of-the-art solver
More informationSolving a Challenging Quadratic 3D Assignment Problem
Solving a Challenging Quadratic 3D Assignment Problem Hans Mittelmann Arizona State University Domenico Salvagnin DEI - University of Padova Quadratic 3D Assignment Problem Quadratic 3D Assignment Problem
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationApplied Mixed Integer Programming: Beyond 'The Optimum'
Applied Mixed Integer Programming: Beyond 'The Optimum' 14 Nov 2016, Simons Institute, Berkeley Pawel Lichocki Operations Research Team, Google https://developers.google.com/optimization/ Applied Mixed
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationA Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
This research is funded by NSF, CMMI and CIEG 0521953: Exploiting Cyberinfrastructure to Solve Real-time Integer Programs A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs Mahdi
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationLinear & Integer Programming: A Decade of Computation
Linear & Integer Programming: A Decade of Computation Robert E. Bixby, Mary Fenelon, Zongao Gu, Irv Lustig, Ed Rothberg, Roland Wunderling 1 Outline Progress in computing machines Linear programming (LP)
More informationIBM ILOG CPLEX Optimization Studio CPLEX Parameters Reference. Version 12 Release 7 IBM
IBM ILOG CPLEX Optimization Studio CPLEX Parameters Reference Version 12 Release 7 IBM IBM ILOG CPLEX Optimization Studio CPLEX Parameters Reference Version 12 Release 7 IBM Copyright notice Describes
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationOutline. Modeling. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Models Lecture 5 Mixed Integer Programming Models and Exercises
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lecture 5 Mixed Integer Programming and Exercises Marco Chiarandini 2. 3. 2 Outline Modeling 1. Min cost flow Shortest path 2. Max flow Assignment
More informationCloud Branching MIP workshop, Ohio State University, 23/Jul/2014
Cloud Branching MIP workshop, Ohio State University, 23/Jul/2014 Timo Berthold Xpress Optimization Team Gerald Gamrath Zuse Institute Berlin Domenico Salvagnin Universita degli Studi di Padova This presentation
More informationThe MIP-Solving-Framework SCIP
The MIP-Solving-Framework SCIP Timo Berthold Zuse Institut Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 23.05.2007 What Is A MIP? Definition MIP The optimization problem
More informationWelcome to Docker Birthday # Docker Birthday events (list available at Docker.Party) RSVPs 600 mentors Big thanks to our global partners:
Docker Birthday #3 Welcome to Docker Birthday #3 2 120 Docker Birthday events (list available at Docker.Party) 7000+ RSVPs 600 mentors Big thanks to our global partners: Travel Planet 24 e-food.gr The
More informationA Single Cloud for Business Applications
A Single Cloud for Business Applications Treb Ryan, Chief Strategy Officer 18 December 2013 Cloud Business Unit, Dimension Data Dimension Data today 2012 global revenues of US$5.8 billion Client-centric,
More informationAccelerating Analytical Workloads
Accelerating Analytical Workloads Thomas Neumann Technische Universität München April 15, 2014 Scale Out in Big Data Analytics Big Data usually means data is distributed Scale out to process very large
More informationIntegrate MATLAB Analytics into Enterprise Applications
Integrate Analytics into Enterprise Applications Lyamine Hedjazi 2015 The MathWorks, Inc. 1 Data Analytics Workflow Preprocessing Data Business Systems Build Algorithms Smart Connected Systems Take Decisions
More informationHeuristics in MILP. Group 1 D. Assouline, N. Molyneaux, B. Morén. Supervisors: Michel Bierlaire, Andrea Lodi. Zinal 2017 Winter School
Heuristics in MILP Group 1 D. Assouline, N. Molyneaux, B. Morén Supervisors: Michel Bierlaire, Andrea Lodi Zinal 2017 Winter School 0 / 23 Primal heuristics Original paper: Fischetti, M. and Lodi, A. (2011).
More informationSolving Large-Scale Energy System Models
Solving Large-Scale Energy System Models Frederik Fiand Operations Research Analyst GAMS Software GmbH GAMS Development Corp. GAMS Software GmbH www.gams.com Agenda 1. GAMS System Overview 2. BEAM-ME Background
More informationConstraint Branching and Disjunctive Cuts for Mixed Integer Programs
Constraint Branching and Disunctive Cuts for Mixed Integer Programs Constraint Branching and Disunctive Cuts for Mixed Integer Programs Michael Perregaard Dash Optimization Constraint Branching and Disunctive
More informationAgenda. Understanding advanced modeling techniques takes some time and experience No exercises today Ask questions!
Modeling 2 Agenda Understanding advanced modeling techniques takes some time and experience No exercises today Ask questions! Part 1: Overview of selected modeling techniques Background Range constraints
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationLocalSolver A New Kind of Math Programming Solver
LocalSolver A New Kind of Math Programming Solver Thierry Benoist Julien Darlay Bertrand Estellon Frédéric Gardi Romain Megel jdarlay@localsolver.com www.localsolver.com 1/18 Who are we? Bouygues, one
More informationSolving Scenarios in the Cloud
Solving Scenarios in the Cloud Franz Nelißen FNelissen@gams.com GAMS Development Corp. GAMS Software GmbH www.gams.com GAMS - History Roots: World Bank, 1976 Alex Meerausfounded GAMS Development Corp.
More informationComparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems Lars M. Hvattum The Norwegian University of Science and Technology Trondheim,
More informationConvex Optimization. Stephen Boyd
Convex Optimization Stephen Boyd Electrical Engineering Computer Science Management Science and Engineering Institute for Computational Mathematics & Engineering Stanford University Institute for Advanced
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationSolving routing & scheduling problems through set-based modeling
LocalSolver Solving routing & scheduling problems through set-based modeling Thierry Benoist, Julien Darlay, Bertrand Estellon, Frédéric Gardi, Romain Megel, Clément Pajean Innovation 24 & LocalSolver
More informationAdvanced Use of GAMS Solver Links
Advanced Use of GAMS Solver Links Michael Bussieck, Steven Dirkse, Stefan Vigerske GAMS Development 8th January 2013, ICS Conference, Santa Fe Standard GAMS solve Solve william minimizing cost using mip;
More informationSeminar report Google App Engine Submitted in partial fulfillment of the requirement for the award of degree Of CSE
A Seminar report On Google App Engine Submitted in partial fulfillment of the requirement for the award of degree Of CSE SUBMITTED TO: SUBMITTED BY: www.studymafia.org www.studymafia.org Acknowledgement
More informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationIntegrate MATLAB Analytics into Enterprise Applications
Integrate Analytics into Enterprise Applications Aurélie Urbain MathWorks Consulting Services 2015 The MathWorks, Inc. 1 Data Analytics Workflow Data Acquisition Data Analytics Analytics Integration Business
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationGrand Central Dispatch
A better way to do multicore. (GCD) is a revolutionary approach to multicore computing. Woven throughout the fabric of Mac OS X version 10.6 Snow Leopard, GCD combines an easy-to-use programming model
More informationThe Ascendance of the Dual Simplex Method: A Geometric View
The Ascendance of the Dual Simplex Method: A Geometric View Robert Fourer 4er@ampl.com AMPL Optimization Inc. www.ampl.com +1 773-336-AMPL U.S.-Mexico Workshop on Optimization and Its Applications Huatulco
More informationComputational Integer Programming. Lecture 12: Branch and Cut. Dr. Ted Ralphs
Computational Integer Programming Lecture 12: Branch and Cut Dr. Ted Ralphs Computational MILP Lecture 12 1 Reading for This Lecture Wolsey Section 9.6 Nemhauser and Wolsey Section II.6 Martin Computational
More informationMultiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression Filipe Brandão fdabrandao@dcc.fc.up.pt arxiv:1312.3836v1 [math.oc] 13 Dec 2013 João Pedro Pedroso pp@fc.up.pt Technical Report
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationOperations Research and Optimization: A Primer
Operations Research and Optimization: A Primer Ron Rardin, PhD NSF Program Director, Operations Research and Service Enterprise Engineering also Professor of Industrial Engineering, Purdue University Introduction
More informationMixed Integer Programming Class Library (MIPCL)
Mixed Integer Programming Class Library (MIPCL) Nicolai N. Pisaruk Belarus State University, Faculty of Economy, Nezavisimosty Av., 4, 220088 Minsk, Belarus April 20, 2016 Abstract The Mixed Integer Programming
More informationMLR Institute of Technology
Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective
More informationRecent Advances In The New Mosek 8
Recent Advances In The New Mosek 8 16-November-2016 Erling D. Andersen www.mosek.com Improvements in version 8 An overview Presolve Reduce memory requirements in the eliminator. Conic presolve. Conic optimizer
More informationApplying Multi-Core Model Checking to Hardware-Software Partitioning in Embedded Systems
V Brazilian Symposium on Computing Systems Engineering Applying Multi-Core Model Checking to Hardware-Software Partitioning in Embedded Systems Alessandro Trindade, Hussama Ismail, and Lucas Cordeiro Foz
More informationMinimum Weight Constrained Forest Problems. Problem Definition
Slide 1 s Xiaoyun Ji, John E. Mitchell Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY, USA jix@rpi.edu, mitchj@rpi.edu 2005 Optimization Days Montreal, Canada May 09, 2005
More informationInteger Programming and Network Modeis
H.A. Eiselt C.-L. Sandblom Integer Programming and Network Modeis With Contributions by K. Spielberg, E. Richards, B.T. Smith, G. Laporte, B.T. Boffey With 165 Figures and 43 Tables &m Springer CONTENTS
More informationResearch Interests Optimization:
Mitchell: Research interests 1 Research Interests Optimization: looking for the best solution from among a number of candidates. Prototypical optimization problem: min f(x) subject to g(x) 0 x X IR n Here,
More informationMOSEK Optimization Suite
MOSEK Optimization Suite Release 8.1.0.72 MOSEK ApS 2018 CONTENTS 1 Overview 1 2 Interfaces 5 3 Remote optimization 11 4 Contact Information 13 i ii CHAPTER ONE OVERVIEW The problem minimize 1x 1 + 2x
More informationStochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition
Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition Xiang Li Process Systems Engineering Laboratory Department of Chemical Engineering Massachusetts
More informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationColumn Generation Based Primal Heuristics
Column Generation Based Primal Heuristics C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck University Bordeaux 1 & INRIA team RealOpt Outline 1 Context Generic Primal Heuristics The Branch-and-Price
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationHP ConvergedSystem for SAP HANA
HP ConvergedSystem for SAP HANA 08.10.2014 Kostiantyn Grygortsov Technical Consultant Project Sharks HP ConvergedSystem Purpose Built Automated ROI, Redefined Copyright 2012 Hewlett-Packard Development
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationDynamic Cuda with F# HPC GPU & F# Meetup. March 19. San Jose, California
Dynamic Cuda with F# HPC GPU & F# Meetup March 19 San Jose, California Dr. Daniel Egloff daniel.egloff@quantalea.net +41 44 520 01 17 +41 79 430 03 61 About Us! Software development and consulting company!
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More information1 Dulcian, Inc., 2001 All rights reserved. Oracle9i Data Warehouse Review. Agenda
Agenda Oracle9i Warehouse Review Dulcian, Inc. Oracle9i Server OLAP Server Analytical SQL Mining ETL Infrastructure 9i Warehouse Builder Oracle 9i Server Overview E-Business Intelligence Platform 9i Server:
More informationSolving Linear and Integer Programs
Solving Linear and Integer Programs Robert E. Bixby Gurobi Optimization, Inc. and Rice University Overview Linear Programming: Example and introduction to basic LP, including duality Primal and dual simplex
More informationBUILD BETTER MICROSOFT SQL SERVER SOLUTIONS Sales Conversation Card
OVERVIEW SALES OPPORTUNITY Lenovo Database Solutions for Microsoft SQL Server bring together the right mix of hardware infrastructure, software, and services to optimize a wide range of data warehouse
More informationBest Practice Deployment of F5 App Services in Private Clouds. Henry Tam, Senior Product Marketing Manager John Gruber, Sr. PM Solutions Architect
Best Practice Deployment of F5 App Services in Private Clouds Henry Tam, Senior Product Marketing Manager John Gruber, Sr. PM Solutions Architect Agenda 1 2 3 4 5 The trend of data center, private cloud
More informationA PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS
Yugoslav Journal of Operations Research Vol 19 (2009), Number 1, 123-132 DOI:10.2298/YUJOR0901123S A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS Nikolaos SAMARAS Angelo SIFELARAS
More informationSecurity and Compliance
Security and Compliance Version 1.3 12/9/2016 Hyperfish Security Whitepaper 1 Table of Contents 1 Introduction... 3 2 Hyperfish... 3 2.1 Product Overview... 3 2.2 How it Works... 3 2.3 Modes of Operation...
More informationCutting Planes for Some Nonconvex Combinatorial Optimization Problems
Cutting Planes for Some Nonconvex Combinatorial Optimization Problems Ismael Regis de Farias Jr. Department of Industrial Engineering Texas Tech Summary Problem definition Solution strategy Multiple-choice
More informationRestrict-and-relax search for 0-1 mixed-integer programs
EURO J Comput Optim (23) :2 28 DOI.7/s3675-3-7-y ORIGINAL PAPER Restrict-and-relax search for - mixed-integer programs Menal Guzelsoy George Nemhauser Martin Savelsbergh Received: 2 September 22 / Accepted:
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationThe AIMMS Outer Approximation Algorithm for MINLP
The AIMMS Outer Approximation Algorithm for MINLP (using GMP functionality) By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper November, 2011 Abstract This document describes how to
More informationIntegrate MATLAB Analytics into Enterprise Applications
Integrate Analytics into Enterprise Applications Dr. Roland Michaely 2015 The MathWorks, Inc. 1 Data Analytics Workflow Access and Explore Data Preprocess Data Develop Predictive Models Integrate Analytics
More informationPrimavera Compression Server 5.0 Service Pack 1 Concept and Performance Results
- 1 - Primavera Compression Server 5.0 Service Pack 1 Concept and Performance Results 1. Business Problem The current Project Management application is a fat client. By fat client we mean that most of
More informationHeuristic Optimization Today: Linear Programming. Tobias Friedrich Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam
Heuristic Optimization Today: Linear Programming Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam Linear programming Let s first define it formally: A linear program is an optimization
More informationMathematical Tools for Engineering and Management
Mathematical Tools for Engineering and Management Lecture 8 8 Dec 0 Overview Models, Data and Algorithms Linear Optimization Mathematical Background: Polyhedra, Simplex-Algorithm Sensitivity Analysis;
More information... IBM Advanced Technical Skills IBM Oracle International Competency Center September 2013
Performance benefits of IBM Power Systems and IBM FlashSystem for JD Edwards EnterpriseOne IBM Power 780 server with AIX and IBM FlashSystem 820 flash storage improves batch performance in a client proof
More informationPrimal Heuristics in SCIP
Primal Heuristics in SCIP Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 10/11/2007 Outline 1 Introduction Basics Integration Into SCIP 2 Available
More informationHow to use your favorite MIP Solver: modeling, solving, cannibalizing. Andrea Lodi University of Bologna, Italy
How to use your favorite MIP Solver: modeling, solving, cannibalizing Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it January-February, 2012 @ Universität Wien A. Lodi, How to use your favorite
More informationMATLAB. Senior Application Engineer The MathWorks Korea The MathWorks, Inc. 2
1 Senior Application Engineer The MathWorks Korea 2017 The MathWorks, Inc. 2 Data Analytics Workflow Business Systems Smart Connected Systems Data Acquisition Engineering, Scientific, and Field Business
More informationLocalSolver. Mathematical programming by Local Search. T. Benoist, J. Darlay, B. Estellon, F. Gardi, R.Megel
LocalSolver Mathematical programming by Local Search T. Benoist, J. Darlay, B. Estellon, F. Gardi, R.Megel 1 28 LocalSolver Who? 2 28 Innovation 24 Large industrial group with businesses in construction,
More informationOracle Big Data Connectors
Oracle Big Data Connectors Oracle Big Data Connectors is a software suite that integrates processing in Apache Hadoop distributions with operations in Oracle Database. It enables the use of Hadoop to process
More information