Find Jobs
Hire Freelancers

Convert a Template to a Website

$10-30 USD

Closed
Posted almost 8 years ago

$10-30 USD

Paid on delivery
Input : T subset of X × Y × Z. That is, T consists of triples (x, y, z) such that x ∈ X, y ∈ Y, and z ∈ Z. Find max subset of T, M ⊆ T, such that for any two distinct triples (x1, y1, z1) ∈ M and (x2, y2, z2) ∈ M, we have x1 ≠ x2, y1 ≠ y2, and z1 ≠ z2. I have to solve it in java using simulated annealing algorithm
Project ID: 10509782

About the project

5 proposals
Remote project
Active 8 yrs ago

Looking to make some money?

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

About the client

Flag of BOSNIA AND HERZEGOVINA
Bosnia and Herzegovina
0.0
0
Member since May 16, 2016

Client Verification

Other jobs from this client

Write some Software
$10-30 USD
Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.