A Metaheuristic Optimization Algorithm for Binary Quadratic Problems

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "A Metaheuristic Optimization Algorithm for Binary Quadratic Problems"

Transcription

1 OSE SEMINAR 22 A Metaheuristic Optimization Algorithm for Binary Quadratic Problems Otto Nissfolk CENTER OF EXCELLENCE IN OPTIMIZATION AND SYSTEMS ENGINEERING ÅBO AKADEMI UNIVERSITY ÅBO, NOVEMBER 29 th 22

2 2 6 Table of contents Problem Formulation The Quadratic Assignment Problem QAP with rank- flow matrix Convex QAP with rank- flow matrix Metaheuristic Algorithm Testproblems Taixxc Results

3 Problem Formulation: The Quadratic Assignment Problem 3 6 min x X n n n n n n f ik d jl x ij x kl + c ij x ij i= j= k= l= i= j= n X = {x x ij = i N j= n x ij = i= j N x ij {,} i,j M}

4 Problem Formulation: QAP with rank- flow matrix 4 6 n n n n f ik d jl x ij x kl = trace(dxfx T ) i= j= k= l=

5 Problem Formulation: QAP with rank- flow matrix 4 6 n n n n f ik d jl x ij x kl = trace(dxfx T ) i= j= k= l= F=qq T

6 Problem Formulation: QAP with rank- flow matrix 4 6 n n n n f ik d jl x ij x kl = trace(dxfx T ) i= j= k= l= F=qq T = trace(dxqq T X T ) = trace(q T X T DXq) = trace(xq T DXq)

7 Problem Formulation: QAP with rank- flow matrix 4 6 n n n n f ik d jl x ij x kl = trace(dxfx T ) i= j= k= l= F=qq T = trace(dxqq T X T ) = trace(q T X T DXq) = trace(xq T DXq) = trace(y T Dy) = y T Dy

8 Problem Formulation: QAP with rank- flow matrix 5 6 min x X,y n y T Dy subject to n y i = x ij q j i j= n y i = n i= j= q j

9 Problem Formulation: Convex QAP with rank- flow matrix 6 6 min x X, y,z n y T (D + Diag(u))y u T z subject to n y i = x ij q j i j= n z i = x ij qj 2 i j= n y i = n i= j= q j

10 Problem Formulation: Metaheuristic Algorithm 7 6 minx T (D + diag(u))x u T x subject to n x i = k i= iteration constraint x iter =

11 Problem Formulation: Metaheuristic Algorithm 8 6 x =

12 Problem Formulation: Metaheuristic Algorithm 8 6 x = x =

13 Problem Formulation: Metaheuristic Algorithm 8 6 x = x = x 2 =

14 Problem Formulation: Metaheuristic Algorithm 8 6 x = x = x 2 = x 3 =

15 Problem Formulation: Metaheuristic Algorithm 8 6 x = x = x 2 = x 3 = x r =

16 Problem Formulation: Metaheuristic Algorithm 8 6 x = x = x 2 = x 3 = x r = x r2 =

17 Testproblems: Taixxc 9 6 T rstu = max v,w {,,} (r t + nv) 2 + (s u + nw) 2 { if i m and j m f ij = otherwise d ij = d n(r )+s n(t )+u = T rstu where (r,s) are the coordinates for i and (t,u) are the coordinates for j

18 Results Objective function value vs. time Time in seconds

19 Results Objective function value vs. time Time in seconds

20 Results Objective function value vs. time Time in seconds

21 Results Objective function value vs. time Time in seconds

22 Results Objective function value vs. time Time in seconds

23 Results Objective function value vs. time Time in seconds

24 Results 6 7 Objective function value vs. iteration count Number of iterations

25 Results 6 7 Objective function value vs. iteration count Number of iterations 5

26 Results 6 7 Objective function value vs. iteration count Number of iterations 5

27 Results 6 7 Objective function value vs. iteration count Number of iterations 5 2

28 Results 6 7 Objective function value vs. iteration count Number of iterations 5 2 6

29 Results 6 7 Objective function value vs. iteration count Number of iterations

30 Results Objective function value vs. iteration count Number of iterations

31 Results Objective function value vs. iteration count Number of iterations

32 Results Objective function value vs. iteration count Number of iterations

33 Results Objective function value vs. iteration count Number of iterations

34 Results Objective function value vs. iteration count Number of iterations

35 Results Objective function value vs. time Time

36 Results Objective function value vs. time Time

37 Results Objective function value vs. time Time

38 Results Objective function value vs. time Time

39 Results Objective function value vs. time Time

40 Results Solution spread min mean max Number of iterations Figure : Spread of the solutions with m = 5

41 Some references 5 6 Alain Billionnet, Sourour Elloumi, and Marie-Christine Plateau. Improving the performance of standard solvers for quadratic - programs by a tight convex reformulation: The qcr method. Discrete Appl. Math., 57:85 97, March 29. R.E. Burkard, E. Cela, P.M. Pardalos, and L.S. Pitsoulis. Handbook of Combinatorial Optimization, volume C. S. Edwards. A branch and bound algorithm for the koopmans-beckmann quadratic assignment problem. Combinatorial Optimization II, 3:35 52, 98. Tjalling C. Koopmans and Martin Beckmann. Assignment problems and the location of economic activities. Econometrica, 25():pp , 957. Otto Nissfolk, Ray Pörn, Tapio Westerlund, and Fredrik Jansson. A mixed integer quadratic reformulation of the quadratic assignment problem with rank- matrix. In Iftekhar A. Karimi and Rajagopalan Srinivasan, editors, th International Symposium on Process Systems Engineering, volume 3 of Computer Aided Chemical Engineering, pages Elsevier, 22. É.D. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 3(2):87 5, 995.

42 6 6 The end of the presentation Thank you for listening! Questions?

Discrete Optimization

Discrete Optimization Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using

More information

Lecture 11: 0-1 Quadratic Program and Lower Bounds

Lecture 11: 0-1 Quadratic Program and Lower Bounds Lecture : - Quadratic Program and Lower Bounds (3 units) Outline Problem formulations Reformulation: Linearization & continuous relaxation Branch & Bound Method framework Simple bounds, LP bound and semidefinite

More information

Optimization Modeling for Mining Engineers

Optimization Modeling for Mining Engineers Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2

More information

Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers

Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers Solving the quadratic assignment problem by means of general purpose mixed integer linear programg solvers Huizhen Zhang Cesar Beltran-Royo Liang Ma 19/04/2010 Abstract The Quadratic Assignment Problem

More information

The Quadratic Assignment Problem

The Quadratic Assignment Problem The Quadratic Assignment Problem Rainer E. Burkard Eranda Çela Panos M. Pardalos Leonidas S. Pitsoulis Abstract This paper aims at describing the state of the art on quadratic assignment problems (QAPs).

More information

Proximal mapping via network optimization

Proximal mapping via network optimization L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:

More information

Compact linearization for binary quadratic problems

Compact linearization for binary quadratic problems 4OR manuscript No. (will be inserted by the editor) Compact linearization for binary quadratic problems Leo Liberti 1 LIX, École Polytechnique, F-91128 Palaiseau, France Received: 25th April 2006 / Revised

More information

An Optimization Approach for Cooperative Communication in Ad Hoc Networks

An Optimization Approach for Cooperative Communication in Ad Hoc Networks An Optimization Approach for Cooperative Communication in Ad Hoc Networks Carlos A.S. Oliveira and Panos M. Pardalos University of Florida Abstract. Mobile ad hoc networks (MANETs) are a useful organizational

More information

Minimum Makespan Scheduling

Minimum Makespan Scheduling Minimum Makespan Scheduling Minimum makespan scheduling: Definition and variants Factor 2 algorithm for identical machines PTAS for identical machines Factor 2 algorithm for unrelated machines Martin Zachariasen,

More information

Support Vector Machines Explained

Support Vector Machines Explained March 1, 2009 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),

More information

Dantzig-Wolfe bound and Dantzig-Wolfe cookbook

Dantzig-Wolfe bound and Dantzig-Wolfe cookbook Dantzig-Wolfe bound and Dantzig-Wolfe cookbook thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline LP strength of the Dantzig-Wolfe The exercise from last week... The Dantzig-Wolfe

More information

Optimizing a Business Process Model by Using Simulation

Optimizing a Business Process Model by Using Simulation Optimizing a Business Process Model by Using Simulation Farzad Kamrani, Rassul Ayani, Anvar Karimson May 17, 2010 Farzad Kamrani (KTH) Optimizing a Business Process Model May 17, 2010 1 / 19 Outline Introduction

More information

Iterated Local Search for the Workload Balancing Problem in Service Enterprises

Iterated Local Search for the Workload Balancing Problem in Service Enterprises Iterated Local Search for the Workload Balancing Problem in Service Enterprises Thanh-Ha Nguyen, Mike Wright Lancaster University Management School, Lancaster, LA1 4YX, UK Abstract In this paper, we consider

More information

LAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION

LAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION LAGRANGIAN RELAXATION TECHNIQUES FOR LARGE SCALE OPTIMIZATION Kartik Sivaramakrishnan Department of Mathematics NC State University kksivara@ncsu.edu http://www4.ncsu.edu/ kksivara SIAM/MGSA Brown Bag

More information

LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005

LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005 LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005 DAVID L. BERNICK dbernick@soe.ucsc.edu 1. Overview Typical Linear Programming problems Standard form and converting

More information

Scheduling of Mixed Batch-Continuous Production Lines

Scheduling of Mixed Batch-Continuous Production Lines Université Catholique de Louvain Faculté des Sciences Appliquées Scheduling of Mixed Batch-Continuous Production Lines Thèse présentée en vue de l obtention du grade de Docteur en Sciences Appliquées par

More information

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

More information

Hub Cover and Hub Center Problems

Hub Cover and Hub Center Problems Hub Cover and Hub Center Problems Horst W. Hamacher, Tanja Meyer Department of Mathematics, University of Kaiserslautern, Gottlieb-Daimler-Strasse, 67663 Kaiserslautern, Germany Abstract Using covering

More information

Variable Neighbourhood Search for the Global Optimization of Constrained NLPs

Variable Neighbourhood Search for the Global Optimization of Constrained NLPs ProceedingsofGO2005,pp.1 5. Variable Neighbourhood Search for the Global Optimization of Constrained NLPs LeoLiberti, 1 andmilandražić 2 1 DEI,PolitecnicodiMilano,P.zzaL.daVinci32,20133Milano,Italy, liberti@elet.polimi.it

More information

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of

More information

Equilibrium computation: Part 1

Equilibrium computation: Part 1 Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

More information

Mixed Integer Linear Programming in R

Mixed Integer Linear Programming in R Mixed Integer Linear Programming in R Stefan Theussl Department of Statistics and Mathematics Wirtschaftsuniversität Wien July 1, 2008 Outline Introduction Linear Programming Quadratic Programming Mixed

More information

Computing a Nearest Correlation Matrix with Factor Structure

Computing a Nearest Correlation Matrix with Factor Structure Computing a Nearest Correlation Matrix with Factor Structure Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Rüdiger

More information

Optimal Hydrothermal Energy Generation for Ghana

Optimal Hydrothermal Energy Generation for Ghana Optimal Hydrothermal Energy Generation for Ghana Christian John Etwire, Stephen B. Twum Abstract: Power production and distribution in Ghana is ever more becoming erratic and expensive, both for the power

More information

A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse

A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse A New Method for Estimating Maximum Power Transfer and Voltage Stability Margins to Mitigate the Risk of Voltage Collapse Bernie Lesieutre Dan Molzahn University of Wisconsin-Madison PSERC Webinar, October

More information

A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization

A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization AUTOMATYKA 2009 Tom 3 Zeszyt 2 Bartosz Sawik* A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization. Introduction The optimal security selection is a classical portfolio

More information

Scheduling Parallel Jobs with Linear Speedup

Scheduling Parallel Jobs with Linear Speedup Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev,m.uetz}@ke.unimaas.nl

More information

Management of Software Projects with GAs

Management of Software Projects with GAs MIC05: The Sixth Metaheuristics International Conference 1152-1 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad

More information

Two objective functions for a real life Split Delivery Vehicle Routing Problem

Two objective functions for a real life Split Delivery Vehicle Routing Problem International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry

More information

Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints

Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Olivier Beaumont,, Paul Renaud-Goud Inria & University of Bordeaux Bordeaux, France 9th Scheduling for Large Scale Systems

More information

Scheduling Shop Scheduling. Tim Nieberg

Scheduling Shop Scheduling. Tim Nieberg Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations

More information

A new Branch-and-Price Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France

A new Branch-and-Price Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France A new Branch-and-Price Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France Stefan Irnich 1 sirnich@or.rwth-aachen.de RWTH Aachen University Deutsche Post Endowed

More information

CHAPTER 9. Integer Programming

CHAPTER 9. Integer Programming CHAPTER 9 Integer Programming An integer linear program (ILP) is, by definition, a linear program with the additional constraint that all variables take integer values: (9.1) max c T x s t Ax b and x integral

More information

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

More information

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

More information

A Continuous-Time Formulation for Scheduling Multi- Stage Multi-product Batch Plants with Non-identical Parallel Units

A Continuous-Time Formulation for Scheduling Multi- Stage Multi-product Batch Plants with Non-identical Parallel Units European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 2005 Elsevier Science B.V. All rights reserved. A Continuous-Time Formulation for Scheduling Multi-

More information

Mobility Management in Cellular Telephony

Mobility Management in Cellular Telephony Mobility Management in Cellular Telephony Benjamin P. Cooke, Darongsae Kwon, Dmitry Glotov, Simon Schurr, Daniel Taylor, Todd Wittman Industrial Mentor: David F. Shallcross June 3, 2002 1 Introduction

More information

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

More information

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

More information

An Overview Of Software For Convex Optimization. Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.

An Overview Of Software For Convex Optimization. Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt. An Overview Of Software For Convex Optimization Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.edu In fact, the great watershed in optimization isn t between linearity

More information

Integer Programming Approach to Printed Circuit Board Assembly Time Optimization

Integer Programming Approach to Printed Circuit Board Assembly Time Optimization Integer Programming Approach to Printed Circuit Board Assembly Time Optimization Ratnesh Kumar Haomin Li Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Abstract A

More information

Big Data Optimization at SAS

Big Data Optimization at SAS Big Data Optimization at SAS Imre Pólik et al. SAS Institute Cary, NC, USA Edinburgh, 2013 Outline 1 Optimization at SAS 2 Big Data Optimization at SAS The SAS HPA architecture Support vector machines

More information

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Alfredo Olivera, Omar Viera Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Herrera y Reissig

More information

The Bi-Objective Pareto Constraint

The Bi-Objective Pareto Constraint The Bi-Objective Pareto Constraint Renaud Hartert and Pierre Schaus UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Belgium {renaud.hartert,pierre.schaus}@uclouvain.be Abstract. Multi-Objective

More information

Optimization of Supply Chain Networks

Optimization of Supply Chain Networks Optimization of Supply Chain Networks M. Herty TU Kaiserslautern September 2006 (2006) 1 / 41 Contents 1 Supply Chain Modeling 2 Networks 3 Optimization Continuous optimal control problem Discrete optimal

More information

A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik

A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik Decision Making in Manufacturing and Services Vol. 4 2010 No. 1 2 pp. 37 46 A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution Bartosz Sawik Abstract.

More information

Transportation Polytopes: a Twenty year Update

Transportation Polytopes: a Twenty year Update Transportation Polytopes: a Twenty year Update Jesús Antonio De Loera University of California, Davis Based on various papers joint with R. Hemmecke, E.Kim, F. Liu, U. Rothblum, F. Santos, S. Onn, R. Yoshida,

More information

Definition of a Linear Program

Definition of a Linear Program Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1

More information

On a Railway Maintenance Scheduling Problem with Customer Costs and Multi-Depots

On a Railway Maintenance Scheduling Problem with Customer Costs and Multi-Depots Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor On a Railway Maintenance Scheduling Problem with Customer Costs and Multi-Depots F. Heinicke (1), A. Simroth (1), G. Scheithauer

More information

Warshall s Algorithm: Transitive Closure

Warshall s Algorithm: Transitive Closure CS 0 Theory of Algorithms / CS 68 Algorithms in Bioinformaticsi Dynamic Programming Part II. Warshall s Algorithm: Transitive Closure Computes the transitive closure of a relation (Alternatively: all paths

More information

CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING

CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations

More information

Completely Positive Cone and its Dual

Completely Positive Cone and its Dual On the Computational Complexity of Membership Problems for the Completely Positive Cone and its Dual Peter J.C. Dickinson Luuk Gijben July 3, 2012 Abstract Copositive programming has become a useful tool

More information

Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness

Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness Débora P. Ronconi Ernesto G. Birgin April 29, 2010 Abstract Scheduling problems involving

More information

Online Adwords Allocation

Online Adwords Allocation Online Adwords Allocation Shoshana Neuburger May 6, 2009 1 Overview Many search engines auction the advertising space alongside search results. When Google interviewed Amin Saberi in 2004, their advertisement

More information

Solving NP Hard problems in practice lessons from Computer Vision and Computational Biology

Solving NP Hard problems in practice lessons from Computer Vision and Computational Biology Solving NP Hard problems in practice lessons from Computer Vision and Computational Biology Yair Weiss School of Computer Science and Engineering The Hebrew University of Jerusalem www.cs.huji.ac.il/ yweiss

More information

A network flow algorithm for reconstructing. binary images from discrete X-rays

A network flow algorithm for reconstructing. binary images from discrete X-rays A network flow algorithm for reconstructing binary images from discrete X-rays Kees Joost Batenburg Leiden University and CWI, The Netherlands kbatenbu@math.leidenuniv.nl Abstract We present a new algorithm

More information

Introduction to Online Learning Theory

Introduction to Online Learning Theory Introduction to Online Learning Theory Wojciech Kot lowski Institute of Computing Science, Poznań University of Technology IDSS, 04.06.2013 1 / 53 Outline 1 Example: Online (Stochastic) Gradient Descent

More information

Branch and Cut for TSP

Branch and Cut for TSP Branch and Cut for TSP jla,jc@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 1 Branch-and-Cut for TSP Branch-and-Cut is a general technique applicable e.g. to solve symmetric

More information

Semi-Supervised Support Vector Machines and Application to Spam Filtering

Semi-Supervised Support Vector Machines and Application to Spam Filtering Semi-Supervised Support Vector Machines and Application to Spam Filtering Alexander Zien Empirical Inference Department, Bernhard Schölkopf Max Planck Institute for Biological Cybernetics ECML 2006 Discovery

More information

Introduction: Models, Model Building and Mathematical Optimization The Importance of Modeling Langauges for Solving Real World Problems

Introduction: Models, Model Building and Mathematical Optimization The Importance of Modeling Langauges for Solving Real World Problems Introduction: Models, Model Building and Mathematical Optimization The Importance of Modeling Langauges for Solving Real World Problems Josef Kallrath Structure of the Lecture: the Modeling Process survey

More information

An Efficient Algorithm for the Dynamic Space Allocation Problem

An Efficient Algorithm for the Dynamic Space Allocation Problem EngOpt 28 - International Conference on Engineering Optimization Rio de Janeiro, Brazil, 1-5 June 28. Abstract An Efficient Algorithm for the Dynamic Space Allocation Problem Geiza Cristina da Silva Tiago

More information

Nimble Algorithms for Cloud Computing. Ravi Kannan, Santosh Vempala and David Woodruff

Nimble Algorithms for Cloud Computing. Ravi Kannan, Santosh Vempala and David Woodruff Nimble Algorithms for Cloud Computing Ravi Kannan, Santosh Vempala and David Woodruff Cloud computing Data is distributed arbitrarily on many servers Parallel algorithms: time Streaming algorithms: sublinear

More information

Lattice Models: The Simplest Protein Model

Lattice Models: The Simplest Protein Model Lattice Models: The Simplest Protein Model The HP-Model (Lau & Dill, 1989) model only hydrophobic interaction alphabet {H, P}; H/P = hydrophobic/polar energy function favors HH-contacts structures are

More information

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2 IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3

More information

Facility Location: Discrete Models and Local Search Methods

Facility Location: Discrete Models and Local Search Methods Facility Location: Discrete Models and Local Search Methods Yury KOCHETOV Sobolev Institute of Mathematics, Novosibirsk, Russia Abstract. Discrete location theory is one of the most dynamic areas of operations

More information

Discuss the size of the instance for the minimum spanning tree problem.

Discuss the size of the instance for the minimum spanning tree problem. 3.1 Algorithm complexity The algorithms A, B are given. The former has complexity O(n 2 ), the latter O(2 n ), where n is the size of the instance. Let n A 0 be the size of the largest instance that can

More information

A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems

A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim, Masakazu Kojima and Kim-Chuan Toh October 2013 Abstract. We propose

More information

Industrial Optimization

Industrial Optimization Industrial Optimization Lessons learned from Optimization in Practice Marco Lübbecke Chair of Operations Research RWTH Aachen University, Germany SICS Stockholm Feb 11, 2013 Discrete Optimization: Some

More information

Linear Programming. March 14, 2014

Linear Programming. March 14, 2014 Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

More information

Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

More information

Scheduling Algorithm with Optimization of Employee Satisfaction

Scheduling Algorithm with Optimization of Employee Satisfaction Washington University in St. Louis Scheduling Algorithm with Optimization of Employee Satisfaction by Philip I. Thomas Senior Design Project http : //students.cec.wustl.edu/ pit1/ Advised By Associate

More information

Convex Programming Tools for Disjunctive Programs

Convex Programming Tools for Disjunctive Programs Convex Programming Tools for Disjunctive Programs João Soares, Departamento de Matemática, Universidade de Coimbra, Portugal Abstract A Disjunctive Program (DP) is a mathematical program whose feasible

More information

ON THE MINIMIZATION OF TRAFFIC CONGESTION IN ROAD NETWORKS WITH TOLLS

ON THE MINIMIZATION OF TRAFFIC CONGESTION IN ROAD NETWORKS WITH TOLLS ON THE MINIMIZATION OF TRAFFIC CONGESTION IN ROAD NETWORKS WITH TOLLS F. STEFANELLO, L.S. BURIOL, M.J. HIRSCH, P.M. PARDALOS, T. QUERIDO, M.G.C. RESENDE, AND M. RITT Abstract. Population growth and the

More information

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

More information

Introduction to Process Optimization

Introduction to Process Optimization Chapter 1 Introduction to Process Optimization Most things can be improved, so engineers and scientists optimize. While designing systems and products requires a deep understanding of influences that achieve

More information

FE670 Algorithmic Trading Strategies. Stevens Institute of Technology

FE670 Algorithmic Trading Strategies. Stevens Institute of Technology FE670 Algorithmic Trading Strategies Lecture 6. Portfolio Optimization: Basic Theory and Practice Steve Yang Stevens Institute of Technology 10/03/2013 Outline 1 Mean-Variance Analysis: Overview 2 Classical

More information

An Introduction on SemiDefinite Program

An Introduction on SemiDefinite Program An Introduction on SemiDefinite Program from the viewpoint of computation Hayato Waki Institute of Mathematics for Industry, Kyushu University 2015-10-08 Combinatorial Optimization at Work, Berlin, 2015

More information

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued. Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.

More information

Introduction to Operations Research

Introduction to Operations Research Introduction to Operations Research Matthew Galati magh@lehigh.edu Department of Industrial and Systems Engineering, Lehigh University Service Parts Solutions, IBM Corporation Introduction to Operations

More information

Adding Inferred Constraints Leads to Runtime Inefficiencies in the Optimization of Piped Water Networks

Adding Inferred Constraints Leads to Runtime Inefficiencies in the Optimization of Piped Water Networks Adding Inferred Constraints Leads to Runtime Inefficiencies in the Optimization of Piped Water Networks Nikhil Hooda Department of Computer Science and Engineering Indian Institute of Technology, Bombay

More information

Nonlinear Arash Model in DEA

Nonlinear Arash Model in DEA Research Journal of Applied Sciences, Engineering and Technology 5(17): 4268-4273, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2014 Submitted: July 27, 2012 Accepted: September

More information

Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation

Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation Computers and Chemical Engineering 25 (2001) 665 674 www.elsevier.com/locate/compchemeng Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation X. Lin,

More information

Genetic Algorithms. Part 2: The Knapsack Problem. Spring 2009 Instructor: Dr. Masoud Yaghini

Genetic Algorithms. Part 2: The Knapsack Problem. Spring 2009 Instructor: Dr. Masoud Yaghini Genetic Algorithms Part 2: The Knapsack Problem Spring 2009 Instructor: Dr. Masoud Yaghini Outline Genetic Algorithms: Part 2 Problem Definition Representations Fitness Function Handling of Constraints

More information

Scheduling and (Integer) Linear Programming

Scheduling and (Integer) Linear Programming Scheduling and (Integer) Linear Programming Christian Artigues LAAS - CNRS & Université de Toulouse, France artigues@laas.fr Master Class CPAIOR 2012 - Nantes Christian Artigues Scheduling and (Integer)

More information

BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION

BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION Ş. İlker Birbil Sabancı University Ali Taylan Cemgil 1, Hazal Koptagel 1, Figen Öztoprak 2, Umut Şimşekli

More information

October 2007. ENSEEIHT-IRIT, Team APO collaboration with GREM 3 -LAPLACE, Toulouse. Design of Electrical Rotating Machines using

October 2007. ENSEEIHT-IRIT, Team APO collaboration with GREM 3 -LAPLACE, Toulouse. Design of Electrical Rotating Machines using using IBBA using ENSEEIHT-IRIT, Team APO collaboration with GREM 3 -LAPLACE, Toulouse October 2007 Collaborations with the GREM 3 Team (LAPLACE-ENSEEIHT) using IBBA Bertrand Nogarede, Professor : Director

More information

Motivated by a problem faced by a large manufacturer of a consumer product, we

Motivated by a problem faced by a large manufacturer of a consumer product, we A Coordinated Production Planning Model with Capacity Expansion and Inventory Management Sampath Rajagopalan Jayashankar M. Swaminathan Marshall School of Business, University of Southern California, Los

More information

Bilinear Prediction Using Low-Rank Models

Bilinear Prediction Using Low-Rank Models Bilinear Prediction Using Low-Rank Models Inderjit S. Dhillon Dept of Computer Science UT Austin 26th International Conference on Algorithmic Learning Theory Banff, Canada Oct 6, 2015 Joint work with C-J.

More information

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm. Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

More information

Airport Planning and Design. Excel Solver

Airport Planning and Design. Excel Solver Airport Planning and Design Excel Solver Dr. Antonio A. Trani Professor of Civil and Environmental Engineering Virginia Polytechnic Institute and State University Blacksburg, Virginia Spring 2012 1 of

More information

Open-source Quality Assurance and Performance Analysis Tools

Open-source Quality Assurance and Performance Analysis Tools Open-source Quality Assurance and Performance Analysis Tools Armin Pruessner, Michael Bussieck, Steven Dirkse, Stefan Vigerske GAMS Development Corporation 1217 Potomac Street NW Washington, DC 20007 1

More information

Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling

Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling Available online at www.sciencedirect.com Computers & Operations Research ( ) www.elsevier.com/locate/dsw Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling

More information

Scheduling Parallel Jobs with Monotone Speedup 1

Scheduling Parallel Jobs with Monotone Speedup 1 Scheduling Parallel Jobs with Monotone Speedup 1 Alexander Grigoriev, Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands, {a.grigoriev@ke.unimaas.nl,

More information

Approximation Algorithms

Approximation Algorithms Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

More information

Solution of a Large-Scale Traveling-Salesman Problem

Solution of a Large-Scale Traveling-Salesman Problem Chapter 1 Solution of a Large-Scale Traveling-Salesman Problem George B. Dantzig, Delbert R. Fulkerson, and Selmer M. Johnson Introduction by Vašek Chvátal and William Cook The birth of the cutting-plane

More information

Capacity Planning for Virtualized Servers 1

Capacity Planning for Virtualized Servers 1 Capacity Planning for Virtualized Servers 1 Martin Bichler, Thomas Setzer, Benjamin Speitkamp Department of Informatics, TU München 85748 Garching/Munich, Germany (bichler setzer benjamin.speitkamp)@in.tum.de

More information

Big Data - Lecture 1 Optimization reminders

Big Data - Lecture 1 Optimization reminders Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics

More information

A Maximal Covering Model for Helicopter Emergency Medical Systems

A Maximal Covering Model for Helicopter Emergency Medical Systems The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 324 331 A Maximal Covering Model

More information