Maxumum flow of a network flow graph

$30-250 AUD

Closed

Posted

over 4 years ago

$30-250 AUD

Paid on delivery

Hello Freelancers, - The problem is the maximum flow problem of nework flow graph. This problem is to be solved with a library in java(Apache commons math) which I already did. The Graph needs to be converted in the from Ax <= B and used with the tool to get the maximum flow. - Now the problem is generate a random system to be used in the tool, in that case you cannot input the data manually in order to use the tool. The budget is $30 and we have 1-3 days. I would prefer that we finish today. I will give you more info and the code so far in chat. Thank you a lot in advance for your time Best!

Algorithm

Java

Software Architecture

Project ID: 22252543

About the project

4 proposals

Remote project

Active 4 yrs ago

Looking to make some money?

Email address

Benefits of bidding on Freelancer

Set your budget and timeframe

Get paid for your work

Outline your proposal

It's free to sign up and bid on jobs

4 freelancers are bidding on average $93 AUD for this job

@golabian2020

Hi there, as I understood you need a random flow network. If this is the job I can get you in hours.

$35 AUD in 1 day

2.5

(4 reviews)

2.5

@AbdurrehmanM

i am a software engineer with 2 yrs experience i can do your work you will be satisfied with my work guaranteed

$30 AUD in 1 day

0.0

(0 reviews)

0.0

@kzada3079

hey dear i just read out your description and i am interested in your project. i am expert in java. if you need quality work than feel free to contact me. Thanks

$250 AUD in 6 days