EL7363 Homework #4 Solutions
1a. Here is the Ampl script for the binary problem.
#define variables#
var x1 binary;
var x2 binary;
var x3 binary;
var x4 binary;
#maximize
maximize summary: 1*x1+3*x2-2*x3+6*x4;
#constrains
subject to limit:5*x1+3*x2+2*x3+1*
EL7363 Homework 7 (Spring, 2015)
Due April 23, 2015
1. For the network in Figure 1, there are four nodes, and ve undirected links. The number on a
link is its link id. The link capacities are given as C1 = 25, C2 = 15, C3 = 12, C4 = 16, C5 = 20
Suppose th
9
C
d
p ldp xdp
d
p Ld xdp
=
d Ld
p xdp
=
d Ld hd
(the last equality is implied by constraint (4.1.7a). Now observe that the assumption of the fact stated in
Exercise 4.3 implies that
EL7363, Fall 2015: Solutions for Homework #3
d Ld hd
= C + ,
where > 0.
Micha Pi ro & Deepankar Medhi
o
Micha Pi ro & Deepankar Medhi
o
SOLUTIONS TO EXERCISES
EXERCISES
(Chapters 2-9)
(Chapters 2-9)
EL7363, Spring 2015: Solutions for Homework #1
Chapter 2
Chapter 2
Solution to 2.1
Solution to 2.1
Link path formulation in link
Solutions for Homework 5
1. With everything remains the same, change the right hand side of (6.1.1b) to 2
2. Solutions:
Note that in Step 1, we need to ensure that a specific i is not counted twice (i.e.,
only once in each of the sets).
3. Step 1: based o
EL7363, Spring 2015: Homework #6
Due April 16th, 2015
1. From textbook 7.1, the network is illustrated in Figure 7.3
2. From textbook 7.2
3. From textbook 7.4
4. As illustrated in Figure 1, there are three source nodes, A, B and C, sending trafc to the co
EL7363 Quiz 1 Spring 2015
Name:
ID:
1. (5 points) Convert the following Linear Programming (LP) problem into its standard form:
max
x,y,z
5x 3y 2z
subject to
7x + y 5z 1,
y 3z 3,
x + 2y + 3z = 12,
x 0, y, z are unconstrained in sign
Answer:
Standard Form
RateandCDNSelectionin
InternetStreamingServices
04/21/15
Bo Yan 0485632
Cing-Yu Chu 0524739
1
Motivation
Internet streaming services are gaining
popularity
Netflix contributes about 30% of the US
downstream traffic
To deliver video streams is difficult
athematical
Comparison of
Link Capacity
and Demand
Flow Restoration
Models
Hadil Ghaban
Guangxin Wang
L7363 Final Project
utlines:
otivation and subject
lgorithms comparison
04/21/15
2
L7363 Final Project
ntroduction
o create a network that has protection
EL7363 Communications Networks
II:
Design and Algorithms
Using AMPL to solve famous
graph theory problems
Sai Jiang,
OBJECTIVES
u Using leant knowledge in EL7363 to solve two
famous graph theory problems :
u CHINESE POSTMAN PROBLEM (CPP)
u TRAVELING SALES
Shortest and Least Time-Spent Routing in
Subway System
EL7363 Communications Networks II:
0486634
Yaolong Li
Outline
1 Search backgroud
2 Two ways to find the paths ( A:find all the paths first. B:using a
modified Dijkstra Algorithm)
3 The algorithm ho
Final project:
Integral Multi-Layer Networks design
Student: Course: Term: Tan Le EL 736 Fall 2006
Polytechnic University
Outline
Problem statement Modeling Solving by Ampl and Cplex Case study and analysis Proposed algorithms Conclusion
2
Problem stateme
RestorationDesign
Beilei Zhan
Dec12 2006
RestorationDesign
Design robust network to failure
Protection paths for each link
Normal capacity + protection capacity
ye
5
6
ye
1
2
3
4
LinkbasedRestoration(LinkPath)
LinkbasedRestoration(LinkPath)
(cont.)
5
6
ze
The Minimal Communication Cost of Gathering Correlated Data over Sensor Networks
EL 736 Final Project Bo Zhang
Motivation: Correlated Data Gathering
Correlated data gathering core component of many applications, real life information processes Large s
A Partial Deployment Formulation for a Distributed Denial of Service Defense scheme
EL736 Final Project Ho-Yu Lam hlam01@utopia.poly.edu
I. I NTRODUCTION Distributed denial-of-service (DDoS) attacks are serious threats to servers in the Internet. In such
AMPL
A Modeling Language for Large-Scale Optimization
Robert Fourer
AMPL Optimization LLC, www.ampl.com
Department of Industrial Engineering & Management Sciences,
Northwestern University, Evanston, IL 60208-3119, USA
Department of Economics, University o
EL7363_Communication_Networks_II_Final_Project
Using AMPL to solve famous graph theory problems
INTRODUCTION:
There are many famous graph theory problems such as Chinese postman problem
(CPP), Traveling salesman problem (TSP), and so on. Before this semes
EL7363_Communication_Networks_II_Final_Project
Using AMPL to solve famous graph theory problems
INTRODUCTION:
There are many famous graph theory problems such as Chinese postman problem
(CPP), Traveling salesman problem (TSP), and so on. Before this semes
AMPL: A Mathematical Programming Language
Robert Fourer
Northwestern University
Evanston, Illinois 60201
David M. Gay
AT&T Bell Laboratories
Murray Hill, New Jersey 07974
Brian W. Kernighan
AT&T Bell Laboratories
Murray Hill, New Jersey 07974
PUBLISHED VE
EL7363 Homework #5
Due in the Class of Nov. 4th, 2013
1. From the text book: 6.1, (you are asked to connect each area
access node to two different switches)
2. From the textbook: 6.3,
3. In a node location design problem, there are four areas need to
be c
9
C
d
p ldp xdp
d
p Ld xdp
=
d Ld
p xdp
=
d Ld hd
(the last equality is implied by constraint (4.1.7a). Now observe that the assumption of the fact stated in
Exercise 4.3 implies that
EL7363, Fall 2013: Solutions for Homework #3
d Ld hd
= C + ,
where > 0.
EL7363, Fall 2013: Homework #6
Due November 11th, 2013
1. From textbook 7.1, the network is illustrated in Figure 7.3
2. From textbook 7.2
3. From textbook 7.4
4. As illustrated in Figure 1, there are three source nodes, A, B and C, sending trafc to the c
EL7363 HW2, Due 09/30/2013
1. From the textbook: 3.4,
2. Reformulate the WDM restoration design problem by assuming wavelength
conversion is available. (Hint: You can still use link-path formulation)
3. From the textbook: 4.1 (Hint: you can show that if t