Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Bookmarks inbookmarks:mine
inbookmarks:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only user 627

Questions on problems whose solution space are one-to-one mappings between two sets.

2
votes
int nbPilots = 50; int nbLocations = 7; int nbDays = 30; range pilots = 1..nbPilots; range days = 1..nbDays; range locations = 1..nbLocations; //decision variable/ dvar boolean assign [pil …
answered Apr 30 '20 by Alex Fleischer
1
vote
since you deal with a scheduling problem I encourage you to have a look at CPOptimizer scheduling within CPLEX. See also https://stackoverflow.com/questions/49405659/mip-vs-cp-for-scheduling-problems
answered Apr 23 '21 by Alex Fleischer