Integer Programming. P.H.S. Torr Lecture 5. Integer Programming
|
|
- Adela Hutchinson
- 6 years ago
- Views:
Transcription
1 Integer Programmng P.H.S. Torr Lecture 5 Integer Programmng
2 Outlne Mathematcal programmng paradgm Lnear Programmng Integer Programmng Integer Programmng Eample Unmodularty LP -> IP Theorem Concluson Specal Lnear Programmng wth Integer Solutons Assgnment Prolem Network Flow Prolem Revew Conclusons 2
3 Mathematcal Programmng Paradgm A mathematcal program s an optmzaton prolem of the form: Mamze (or Mnmze f( suject to: g( = 0 h( 0 Mathematcal Programmng paradgm where = [,...n] s a suset of R n, the functons g and h are called constrants, and f s called the ojectve functon. 3
4 Lnear Programmng (LP The goal of Lnear programmng s to: (MaMnmze: Suject to: C T A 0 Where C T s a coeffcent vector for f, A s a constrant matr, and s a constrant vector. The constrant set: { A } s a conve polyhedron, and f s lnear so t s conve. Therefore, LP has convety, and the local mn/ma s the gloal mn/ma 4
5 Integer Programmng (IP The goal of Integer programmng s to: (MaMnmze: Suject to: C T A nteger Typcally, = 0, (0, Integer Programmng 5
6 IP Eample (Matchng Prolem Gven a graph G, fnd mamal set of edges n G, such that no two edges are adjacent to the same verte. Mamum matchng: matchng of mamum cardnalty. Weghted matchng: matchng wth 2 e e 2 3 e 3 ma w( e 6
7 7 IP Eample (Matchng Prolem otherwse matchng n ncluded s f 0 e 3 2 ma 0 to s ,. 3 2 e e 2 e 3
8 IP Eample (Matchng Prolem In matr form: ma c T A s. to 0, Where = [, ]T, A = ncdence matr of G e.g. A e e e
9 9 IP Eample (Matchng Prolem ma s.to 3 2 One soluton to ths IP prolem:, 2, 3 = 0, =, 2 = 0, 3 = 0 Other possle solutons: = 0, 2 =, 3 = 0, or = 0, 2 = 0, 3 =
10 Queston Can the soluton to ths IP prolem e otaned y droppng the ntegralty constrant: = 0, And solvng the LP prolem nstead? In our eample, soluton to the IP s not otanale from LP. Reason: matr A does not have certan property (total unmodularty needed to guarantee nteger solutons. 0
11 Queston If = 0, s relaed, such that 0, then the soluton to the assocated LP prolem s non nteger: 2 3 Reason: the A matr Is not totally unmodular: A = - 2
12 Unmodularty: LP -> IP Gven a constrant set n standard form where A, are nteger A 0 Partton A = [B/N ]; = [ B, N ] B s nonsngular m m ass, N s non-asc 2
13 Unmodularty: LP -> IP Basc soluton s N B 0 B In partcular, when B = I and B - = I then X B = a soluton can e otaned y nspecton (as n the ntal step of Smple method. 3
14 Unmodularty: LP -> IP Snce B = B wth N = 0, nteger A suffcent condton for a asc soluton B to e nteger s that B e an nteger matr 4
15 Unmodularty A square matr B s called unmodular f D = det B = An nteger matr A s totally unmodular f every square, nonsngular sumatr of A s unmodular. Equvalently: A s totally unmodular f every sudetermnant of A s 0, +, or. 5
16 Unmodularty Recall that for B nonsngular: B B det B Where B +, adjont matr = [ j cofactor of element a j n det A ] T B + and det B are nteger f B s nteger 6
17 B Unmodularty B ( ( ( ( ( 2 ( ( ( 2 ( Cofactor of a j : Determnant otaned y omttng the th row and the j th column of A and then multplyng y (- + j T 7
18 Unmodularty For B unmodular, B nteger: If A s totally unmodular, every ass matr B s unmodular and every asc soluton Is nteger. ( B, y N = ( B, 0 In partcular, the optmal soluton s nteger 8
19 Theorem : If A s totally unmodular then every asc soluton of A = s nteger. For LP s wth equalty constrants total unmodularty s suffcent ut not necessary. For LP wth nequalty constrants, A, total unmodularty of A s oth necessary and suffcent for all etreme ponts of s = { : A, 0 } to e nteger for every nteger vector. 9
20 Concluson: Any IP wth totally unmodular constrant matr can e solved as an LP. Totally unmodular matr : a j = 0, +, - Also, every determnant of A must e 0, + or - COULD ALSO HAVE USED CRAMMERS RULE. 20
21 Specal Lnear Programs wth Integer Solutons Network flow prolems: ma flow mn cost flow assgnment prolem shortest path transportaton prolem are LP wth the property that they possess optmal solutons n ntegers. 2
22 Some Totally Unmodular Lnear Programs Assgnment prolem (specal case of mn cost capactated flow prolems [ m jos m men ] j 0 f man s otherwse assgned to jo j c j = cost of assgnng man to jo j 22
23 Some Totally Unmodular Lnear Programs Ma c j s. to. j j m m j j j j 0,,, j m ( m ( man per jo jo per man 23
24 24 X X X 2 X 3 X 2 X 22 X 23 X 3 X 32 X 33 Some Totally Unmodular Lnear Programs
25 25 c T ma In matr notaton: A = where A m 2m m 2... Eactly m s n each row Eactly 2 s n each column Some Totally Unmodular Lnear Programs
26 Network Flow Prolems Gven: a set of orgns V ; each orgn V ; supples a of commodty. a set of destnatons V 2 ; each destnaton j V 2 ; has a demand of commodty. cost per unt commodty; c j assocated wth sendng commodty through (, j. 26
27 27 j j 2 Γ j j Γ j j c 0 Γ V V 0 Γ V a ( ( for for ( ( for (, ( (, ( Constrant Set: (Totally unmodular Network Flow Prolems
28 Network Flow Prolems Specal case: for sngle source, sngle destnaton, ma flow prolem f 0 j j (, j Γ ( ( j, Γ ( f for source node for nternal nodes for destnato n node n any case: A 28
29 Revew No matter whch prolem t s: the general format s A It can e shown that mn cost flow ma flow mn cut If A s totally unmodular then [A/I ] s also totally unmodular The transpose of totally unmodular matr s also totally unmodular. A A' I where A = ncdence matr of the correspondng dgraph, totally unmodular. I = dentty matr, A s totally unmodular. 29
30 Revew No effcent algorthms est for general Integer Programmng prolems Eplot a specal structure of the prolem (total unmodularty, etc. to otan nteger solutons y solvng smpler prolems. Transform the prolem to another prolem for whch an appromate soluton s easer to fnd. Once the structure of the prolem s well understood, use heurstc, ut stay away from rute force approach. 30
31 Conclusons A large numer of prolems can e cast n analytcal form: Graph Theory Mathematcal Optmzaton For some prolems effcent algorthms est. For others need to resort to heurstc, suoptmal solutons. Some known successful heurstc approaches Smulated annealng LP roundng 3
Network Reconfiguration in Distribution Systems Using a Modified TS Algorithm
Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty
More informationNetwork Theory. EC / EE / IN. for
Network Theory for / / IN By www.thegateacademy.com Syllabus Syllabus for Networks Network Graphs: Matrces Assocated Wth Graphs: Incdence, Fundamental ut Set and Fundamental rcut Matrces. Soluton Methods:
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationFixed-Charge Network Flow Problems with a Hybrid Optimization and. Constraint Programming Approach. Solving. John Hooker, Hak-Jin Kim
Solvng Fed-Charge Network Flow Problems wth a Hbrd Optmaton and Constrant Programmng Approach John Hooker, Hak-Jn Km Carnege ellon Unverst ISP, August 2 An Approach that Combnes Optmaton and Constrant
More informationNETWORK 2001 Transportation Planning Under Multiple Objectives
NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationAlgorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov
Algorthms Arlne Schedulng Arlne Schedulng Desgn and Analyss of Algorthms Andre Bulatov Algorthms Arlne Schedulng 11-2 The Problem An arlne carrer wants to serve certan set of flghts Example: Boston (6
More informationEE301 AC Source Transformation and Nodal Analysis
EE0 AC Source Transformaton and Nodal Analyss Learnng Ojectves. Construct equvalent crcuts y convertng an AC voltage source and a resstor to an AC current source and a resstor. Apply Nodal Analyss to an
More informationCapacitated set-covering model considering the distance objective and dependency of alternative facilities
IOP Conference Seres: Materals Scence and Engneerng PAPER OPEN ACCESS Capactated set-coverng model consderng the dstance obectve and dependency of alternatve facltes To cte ths artcle: I Wayan Suletra
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationNetworks. Backpropagation. Backpropagation. Introduction to. Backpropagation Network training. Backpropagation Learning Details 1.04.
Networs Introducton to - In 1986 a method for learnng n mult-layer wor,, was nvented by Rumelhart Paper Why are what and where processed by separate cortcal vsual systems? - The algorthm s a sensble approach
More informationReview: Our Approach 2. CSC310 Information Theory
CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages
More informationSequential Designs Using Retiming and Multiple Supply Voltages
Smultaneous and Aerage Power Optmzaton n Synchronous Sequental Desgns Usng Retmng and Multple Supply Voltages A. K. Allam and J. Ramanujam Electrcal and Computer Engneerng Department, Lousana State Unersty,
More informationTarget Response Adaptation for Correlation Filter Tracking
Target Response Adaptaton for Correlaton Flter Tracng Adel Bb, Matthas Mueller, and Bernard Ghanem Image and Vdeo Understandng Laboratory IVUL, Kng Abdullah Unversty of Scence and Technology KAUST, Saud
More information4.3- Modeling the Diode Forward Characteristic
2/8/2012 3_3 Modelng the ode Forward Characterstcs 1/3 4.3- Modelng the ode Forward Characterstc Readng Assgnment: pp. 179-188 How do we analyze crcuts wth juncton dodes? 2 ways: Exact Solutons ffcult!
More informationDecision aid methodologies in transportation
Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt
More informationOptimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation
T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and
More informationPower Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach
ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of
More informationUNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT
UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationA TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS
A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5
More informationKeywords parasitic flow loops, flow networks, dominated parasitic flow loops, optimization 1. PARASITIC FLOW LOOPS IN NETWORKS
Internatonal Journal of Operatons Research Vol., No., 00 07 (04) Domnated parastc flow loops n networks M.Todnov * Department of Mechancal Engneerng and Mathematcal Scences, Oxford Brookes Unversty Oxford,
More informationEE 508 Lecture 6. Degrees of Freedom The Approximation Problem
EE 508 Lecture 6 Degrees of Freedom The Approxmaton Problem Revew from Last Tme Desgn Strategy Theorem: A crcut wth transfer functon T(s) can be obtaned from a crcut wth normalzed transfer functon T n
More informationYutaka Matsuo and Akihiko Yokoyama. Department of Electrical Engineering, University oftokyo , Hongo, Bunkyo-ku, Tokyo, Japan
Optmzaton of Installaton of FACTS Devce n Power System Plannng by both Tabu Search and Nonlnear Programmng Methods Yutaka Matsuo and Akhko Yokoyama Department of Electrcal Engneerng, Unversty oftokyo 7-3-,
More informationFall 2018 #11 Games and Nimbers. A. Game. 0.5 seconds, 64 megabytes
5-95 Fall 08 # Games and Nmbers A. Game 0.5 seconds, 64 megabytes There s a legend n the IT Cty college. A student that faled to answer all questons on the game theory exam s gven one more chance by hs
More informationIntensity- modulated radiotherapy. Beyond fluence map op.miza.on
Intensty- modulated radotherapy ì Beyond fluence map op.mza.on Overvew So far: Fluence map op.mza.on Now: - Intensty- modulated proton therapy (IMRT) Extensons n IMRT plannng - leaf sequencng - drect aperture
More informationStrategies for Enhanced Dual Failure Restorability with Static or Reconfigurable p-cycle Networks
Reprnt of paper to appear at the 2004 Internatonal Conference on Communcatons (ICC 2004), Pars, France, June 2004. Strateges for Enhanced Dual Falure Restorablty wth Statc or Reconfgurable p-cycle Networs
More informationPlanning of Relay Station Locations in IEEE (WiMAX) Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 010 proceedngs. Plannng of Relay Staton Locatons n IEEE 0.16 (WMAX) Networks
More informationPrevention of Sequential Message Loss in CAN Systems
Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationA Recursive Approach to Compute Bit Error Rate in Underwater Channels with Multiple Paths
A Recursve Approach to Compute Bt Error Rate n Underwater Channels wth Multple Paths C. Chen A. Ad Center for Wreless Communcaton and Sgnal Processng Research Dept. of Electrcal and Computer Engneerng
More informationMooring Cost Sensitivity Study Based on Cost-Optimum Mooring Design
Proceedngs of Conference 8 Korean Socety of Ocean Engneers May 9-3, Cheju, Korea Moorng Cost Senstvty Study Based on Cost-Optmum Moorng Desgn SAM SANGSOO RYU, CASPAR HEYL AND ARUN DUGGAL Research & Development,
More informationDynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint
Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationPower Allocation in Wireless Multi-User Relay Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL 8, NO 5, MAY 2009 2535 Power Allocaton n Wreless Mult-User Relay Networks Khoa T Phan, Student Member, IEEE, Tho Le-Ngoc, Fellow, IEEE, Sergy A Vorobyov,
More informationEnhanced Artificial Neural Networks Using Complex Numbers
Enhanced Artfcal Neural Networks Usng Complex Numers Howard E. Mchel and A. A. S. Awwal Computer Scence Department Unversty of Dayton Dayton, OH 45469-60 mchel@cps.udayton.edu Computer Scence & Engneerng
More informationComparison of Two Measurement Devices I. Fundamental Ideas.
Comparson of Two Measurement Devces I. Fundamental Ideas. ASQ-RS Qualty Conference March 16, 005 Joseph G. Voelkel, COE, RIT Bruce Sskowsk Rechert, Inc. Topcs The Problem, Eample, Mathematcal Model One
More informationMaster Physician Scheduling Problem 1
Master Physcan Schedulng Problem 1 Aldy Gunawan and Hoong Chun Lau School of Informaton Systems, Sngapore Management Unversty, Sngapore Abstract We study a real-world problem arsng from the operatons of
More informationChinese Remainder. Discrete Mathematics Andrei Bulatov
Chnese Remander Introducton Theorem Dscrete Mathematcs Andre Bulatov Dscrete Mathematcs Chnese Remander Theorem 34-2 Prevous Lecture Resdues and arthmetc operatons Caesar cpher Pseudorandom generators
More informationCZECH TECHNICAL UNIVERSITY IN PRAGUE FACULTY OF ELECTRICAL ENGINEERING DIPLOMA THESIS. Scheduling and Visualization of Manufacturing Processes
CZECH TECHNICAL UNIVERSITY IN PRAGUE FACULTY OF ELECTRICAL ENGINEERING DIPLOMA THESIS Schedulng and Vsualzaton of Manufacturng Processes Prague, 2008 Author: Roman Čapek Schedulng and Vsualzaton of Manufacturng
More informationBee Hive Algorithm to Optimize Multi Constrained Piecewise Non-Linear Economic Power Dispatch Problem in Thermal Units
Internatonal Journal on Electrcal Engneerng and Informatcs Volume 3, Number 1, 011 Bee Hve Algorthm to Optmze Mult Constraned ecewse Non-Lnear Economc ower Dspatch roblem n Thermal Unts B. admanabhan 1,
More informationNetwork Reconfiguration for Load Balancing in Distribution System with Distributed Generation and Capacitor Placement
World Academy of Scence, Engneerng and Technology nternatonal Journal of Electrcal and Computer Engneerng Networ Reconfguraton for Load Balancng n Dstrbuton System wth Dstrbuted Generaton and Capactor
More informationTotal Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
21st Internatonal Conference on VLSI Desgn Total Power Mnmzaton n Gltch-Free CMOS Crcuts Consderng Process Varaton Yuanln Lu * Intel Corporaton Folsom, CA 95630, USA yuanln.lu@ntel.com Abstract Compared
More informationA comparative study of initial basic feasible solution methods for transportation problems
Matheatcal Theory and Modelng ISSN 2224-5804 (Paper) ISSN 2225-0522 (Onlne) www.ste.org A coparatve study of ntal basc feasble soluton ethods for transportaton probles Abstract Abdul Sattar Sooro 1 Gurudeo
More informationStochastic Programming Models for Optimization of Surgery Delivery Systems
Stochastc Programmng Models for Optmzaton of Surgery Delvery Systems Bran Denton Department of Industral and Operatons Engneerng Unversty of Mchgan Collaborators Har Balasubramanan (Unversty of Massachusetts)
More informationSolution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 2006 Soluton of a certan class of network flow problems wth cascaded demand aggregaton
More informationTotal Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation
Total Power Mnmzaton n Gltch-Free CMOS Crcuts Consderng Process Varaton Abstract Compared to subthreshold age, dynamc power s normally much less senstve to the process varaton due to ts approxmately lnear
More informationA Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)
A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport
More informationA Mathematical Model for Restoration Problem in Smart Grids Incorporating Load Shedding Concept
J. Appl. Envron. Bol. Sc., 5(1)20-27, 2015 2015, TextRoad Publcaton ISSN: 2090-4274 Journal of Appled Envronmental and Bologcal Scences www.textroad.com A Mathematcal Model for Restoraton Problem n Smart
More informationOn channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks. Mohsen Jahanshahi*
Int. J. Ad Hoc and Ubqutous Computng, Vol. 12, No. 4, 2013 225 On channel assgnment and multcast routng n mult-channel mult-rado wreless mesh networks Mohsen Jahanshah* Computer Engneerng Department, Scences
More informationAuthor(s)Jiang, Weiwei; He, Xin; Matsumoto, T. Citation IEEE Communications Letters, PP(99):
JAIST Repos https://dspace.j Ttle Power Allocaton n an Asymmetrc W Network Author(s)Jang, Wewe; He, Xn; Matsumoto, T Ctaton IEEE Communcatons Letters, PP(99): Issue Date 206--03 Type Journal Artcle Text
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationC. G. Cassandras and Y. Geng
BUILDING A CYBER-PHYSICAL INFRASTRUCTURE FOR THE SMART CITY: THE CASE OF SMART PARKING C. G. Cassandras and Y. Geng Dvson of Systems Engneerng Dept. of Electrcal and Computer Engneerng Center for Informaton
More informationEnergy saving in fixed wireless broadband networks
Energy savng n fxed wreless broadband networks Davd Coudert, Napoleao Nepomuceno, Issam Tahr To cte ths verson: Davd Coudert, Napoleao Nepomuceno, Issam Tahr. Energy savng n fxed wreless broadband networks.
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationGP-based Design and Optimization of a Floating Voltage Source for Low-Power and Highly Tunable OTA Applications
Manuscrpt receved Jun. 11, 2007; revsed Sep. 15, 2007 GP-based Desgn and Optmzaton of a Floatng Voltage Source for Low-Power and Hghly Tunable OTA Applcatons MARYAM SHOJAEI BAGHINI *, RAJENDRA KANPHADE
More informationHarmony Search and OPF Based Hybrid Approach for Optimal Placement of Multiple DG Units
Harmony Search and OPF Based Hybrd Approach for Optmal Placement of Multple Unts Sandeep Kaur Department of Electrcal Engneerng Indan Insttute of Rooree Rooree, Inda sandpsaroa@gmal.com. B. Kumbhar Department
More informationAn Efficient Extension of Network Simplex Algorithm
Journal of Industral Engneerng 2(2009)1-9 An Effcent Extenson of Network Smplex Algorthm Hassan Rashd a, Edward P. K. Tsang b a School of Computer Scence and Electronc Systems Engneerng, Unversty of Essex,
More informationPrivacy-Preserving Data Mining Shared analysis without shared data. 16 February 2011 Chris Clifton
Prvacy-Preservng Data Mnng Shared analyss wthout shared data 16 February 2011 Chrs Clfton Idea: Collaborate to learn (only) desred results Data owners and FDA partcpate n protocol Results same as f all
More informationA Method Based on Dial's Algorithm for Multi-time Dynamic Traffic Assignment
Sensors & Transducers, Vol. 66, Issue 3, March 04, pp. 48-54 Sensors & Transducers 04 by IFSA Publshng, S. L. http://www.sensorsportal.com A Method Based on Dal's Algorthm for Mult-tme Dynamc Traffc Assgnment
More informationOptimal Grid Topology using Genetic Algorithm to Maintain Network Security
Internatonal Journal of Engneerng Scences, 2(8) August 23, Pages: 388-398 TI Journals Internatonal Journal of Engneerng Scences www.tournals.com ISSN 236-6474 Optmal Grd Topology usng Genetc Algorthm to
More informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationMovement - Assisted Sensor Deployment
Intro Self Deploy Vrtual Movement Performance Concluson Movement - Asssted Sensor Deployment G. Wang, G. Cao, T. La Porta Dego Cammarano Laurea Magstrale n Informatca Facoltà d Ingegnera dell Informazone,
More informationDownloaded from ijiepr.iust.ac.ir at 5:13 IRST on Saturday December 15th 2018
Internatonal Journal of Industral Eng. & roducton Research (2008) pp. 21-29 Volume 19, Number 4, 2008 Internatonal Journal of Industral Engneerng & roducton Research Journal Webste: http://een.ust.ac.r/
More informationTRAIN PLATFORMING PROBLEM Ľudmila JÁNOŠÍKOVÁ 1, Michal KREMPL 2
GIS Ostrava 2014 - Geonformatcs for Intellgent Transportaton Abstract TRAIN PLATFORMING PROBLEM Ľudmla JÁNOŠÍKOVÁ 1, Mchal KREMPL 2 1 Department of Transportaton Networks, Faculty of Management Scence
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationproblems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance
palette of problems Davd Rock and Mary K. Porter 1. If n represents an nteger, whch of the followng expressons yelds the greatest value? n,, n, n, n n. A 60-watt lghtbulb s used for 95 hours before t burns
More informationCS345a: Data Mining Jure Leskovec and Anand Rajaraman Stanford University
CS345a: Data Mnng Jure Leskovec and Anand Rajaraman Stanford Unversty HW3 s out Poster sesson s on last day of classes: Thu March 11 at 4:15 Reports are due March 14 Fnal s March 18 at 12:15 Open book,
More informationExploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,
More informationInternational Journal on Power Engineering and Energy (IJPEE) Vol. (4) No. (4) ISSN Print ( ) and Online ( X) October 2013
Internatonal Journal on Power Engneerng and Energy (IJPEE) Vol. (4) No. (4) ISSN Prnt (34 738) and Onlne (34 730X) October 03 Soluton of The Capactor Allocaton Problem Usng A New Accelerated Partcle Swarm
More informationThe Effect Of Phase-Shifting Transformer On Total Consumers Payments
Australan Journal of Basc and Appled Scences 5(: 854-85 0 ISSN -88 The Effect Of Phase-Shftng Transformer On Total Consumers Payments R. Jahan Mostafa Nck 3 H. Chahkand Nejad Islamc Azad Unversty Brjand
More informationDIRECT collocation methods for solving a continuous
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, VOL. 6, NO. 4, JULY 018 1475 Adaptve Mesh Refnement Method for Optmal Control Usng Decay Rates of Legendre Polynomal Coeffcents Abstract An adaptve mesh
More informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More informationDistributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation
Dstrbuted and Optmal Reduced Prmal-Dual Algorthm for Uplnk OFDM Resource Allocaton Xaoxn Zhang, Lang Chen, Janwe Huang, Mnghua Chen, and Yupng Zhao Abstract Orthogonal frequency dvson multplexng OFDM s
More informationPassive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)
Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called
More informationSimultaneous Reconfiguration with DG Placement using Bit-Shift Operator Based TLBO
Smultaneous Reconfguraton wth Placement usng Bt-Shft Operator Based TLBO Ayan Ghosh, *Deepak Kumar EEE Department B.I.T Mesra, Ranch Jharkhand, Inda *deepakmek9@gmal.com S. R. Samantaray School of Electrcal
More informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationModified Bat Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problem
Avalable onlne at www.jpe-onlne.com vol., no. 7, November 07, pp. 999-0 DOI: 0.90/jpe.7.07.p.9990 Modfed Bat Algorthm for the Mult-Objectve Flexble Job Shop Schedulng Problem Haodong Zhu a,b, Baofeng He
More informationNATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985
NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT
More informationMASTER'S THESIS. Resource Allocation in Ka-band Satellite Systems. by Youyu Feng Advisor: John S. Baras CSHCN MS (ISR MS )
MASTER'S THESIS Resource Allocaton n Ka-band Satellte Systems by Youyu Feng Advsor: John S. Baras CSHCN MS 2001-1 (ISR MS 2001-2) Report Documentaton Page Form Approved OMB No. 0704-0188 Publc reportng
More informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationECONOMIC DISPATCH BY USING DIFFERENT CROSSOVER OPERATORS OF GENETIC ALGORITHM
ISTABUL UIVERSITY JOURAL OF ELECTRICAL & ELECTROICS EIEERI YEAR VOLUME UMBER : 00 : 0 : (73-83) ECOOMIC DISATCH BY USI DIFFERET CROSSOVER OERATORS OF EETIC ALORITHM Serhat DUMA, Al ÖZTÜRK, M. Kenan DÖŞOĞLU
More informationDEGL BASED OPTIMIZATION FOR PRACTICAL CONSTRAINED ECONOMIC POWER DISPATCH PROBLEM
Journal of Electrcal Engneerng BASED OTIMIZATION FOR RACTICAL CONSTRAINED ECONOMIC OWER DISATCH ROBLEM B.ADMANABHAN (1) SIVAKUMAR R.S (2) (1) M.E (ower Sys Engg), Sardar Raja College of Engneerng, Alangulam,
More informationOptimization model of fuzzy location-routing problem of victim search in flood disaster
Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 214, 6(6):28-285 Research Artcle ISSN : 975-7384 CODEN(USA) : JCPRC5 Optmzaton model of fuzzy locaton-routng problem of vctm
More informationA General Framework for Codes Involving Redundancy Minimization
IEEE TRANSACTIONS ON INFORMATION THEORY A General Framework for Codes Involvng Redundancy Mnmzaton Mchael Baer, Member, IEEE Abstract A framework wth two scalar parameters s ntroduced for varous problems
More informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationAsynchronous TDMA ad hoc networks: Scheduling and Performance
Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,
More informationOptimal Reconfiguration of Distribution System by PSO and GA using graph theory
Proceedngs of the 6th WSEAS Internatonal Conference on Applcatons of Electrcal Engneerng, Istanbul, Turkey, May 27-29, 2007 83 Optmal Reconfguraton of Dstrbuton System by PSO and GA usng graph theory Mehd
More informationSpectrum Auction Framework for Access Allocation in Cognitive Radio Networks
Spectrum Aucton Framework for Access Allocaton n Cogntve Rado Networks ABSTRACT Gaurav S. Kasbekar Department of Electrcal and Systems Engneerng Unversty of Pennsylvana kgaurav@seas.upenn.edu Cogntve rado
More informationOptimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks
Optmal Local Topology Knowledge for Energy Effcent Geographcal Routng n Sensor Networks Tommaso Meloda, Daro Pompl, Ian F. Akyldz Broadband and Wreless Networkng Laboratory School of Electrcal and Computer
More informationErgodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power
7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power
More informationCoordinating the Motions of Multiple Robots with Specified Trajectories
Coordnatng the Motons of Multple Robots wth Specfed Trajectores Srnvas Akella Seth Hutchnson Department of Computer Scence Beckman Insttute Rensselaer Polytechnc Insttute Unversty of Illnos, Urbana-Champagn
More informationA NONLINEAR PROGRAMMING PROBLEM USING BRANCH AND BOUND METHOD
REVIST INVESTIGCION OPERCIONL VOL. 3, NO. 91-98, 17 NONLINER PROGRMMING PROBLEM USING BRNCH ND BOUND METHOD Tanveer. Tarray and Muzafar R. Bhat Islamc Unversty of Scence and Technology, wantpora, Pulwama,
More informationInternational Journal of Industrial Engineering Computations
Internatonal Journal of Industral Engneerng Computatons 3 () 7 8 Contents lsts avalable at GrowngScence Internatonal Journal of Industral Engneerng Computatons homepage: www.growngscence.com/ec Transmsson
More informationThe Application of Tabu Search Algorithm on Power System Restoration
The Applcaton of Tabu Search Algorthm on Power System Restoraton FANG Xn-yan,CAI Xao-y, Jang Chuan-wen Dept.of Electrcal Eng.., Shangha Jaotong Unv., Shangha 200240, Chna Abstract:-The essay s just accordng
More information