Groups
Conversations
All groups and messages
Send feedback to Google
Help
Training
Sign in
Groups
sci.op-research
Conversations
About
Sort By Relevance
Sort By Date
1–24 of 24
Vincent Bergeron
,
Lutz Tautenhahn
3
8/25/02
I'm looking for a software for a long time...
unread,
I'm looking for a software for a long time...
8/25/02
Ben Horner
, …
Lutz Tautenhahn
3
5/23/02
rotate a vector...
of the 2 vectors). For other vector rotating problems have a look at my webpage (in german) at http://www.tu-chemnitz.de/~luta/drawlat/drawmath.html Hope this helps,
Lutz
Tautenhahn
unread,
rotate a vector...
of the 2 vectors). For other vector rotating problems have a look at my webpage (in german) at http://www.tu-chemnitz.de/~luta/drawlat/drawmath.html Hope this helps,
Lutz
Tautenhahn
5/23/02
Ben Horner
, …
Jay and Diane Rudin
3
5/19/02
tesellation (sp?) of equilateral triangles on a sphere...
-0.85065 -0.447212 0.723606 0.525732 0.447212 -0.276394 0.85065 0.447212 -0.894432 0 0.447212 -0.276394 -0.85065 0.447212 0.723606 -0.525732 0.447212 0 0 1 Regards,
Lutz
Tautenhahn
unread,
tesellation (sp?) of equilateral triangles on a sphere...
-0.85065 -0.447212 0.723606 0.525732 0.447212 -0.276394 0.85065 0.447212 -0.894432 0 0.447212 -0.276394 -0.85065 0.447212 0.723606 -0.525732 0.447212 0 0 1 Regards,
Lutz
Tautenhahn
5/19/02
kel
, …
Paul A. Rubin
3
5/7/02
balancing assignment according to the fraction of the pie
which has the same total cost as the solution with alpha=1 and take this as your optimum solution. I hope this suggestion works (I didn't try it out). Regards,
Lutz
Tautenhahn
.
unread,
balancing assignment according to the fraction of the pie
which has the same total cost as the solution with alpha=1 and take this as your optimum solution. I hope this suggestion works (I didn't try it out). Regards,
Lutz
Tautenhahn
.
5/7/02
Marco Gerlach
, …
Lutz Tautenhahn
4
5/6/02
solving the assignment via the hungarian method
unread,
solving the assignment via the hungarian method
5/6/02
GJ
,
Lutz Tautenhahn
2
4/21/02
capacitated single level lotsizing algorithm
unread,
capacitated single level lotsizing algorithm
4/21/02
Laurent Bagnoud
, …
Lutz Tautenhahn
6
12/19/01
seat attribution
home/
lutz
.
tautenhahn
/plt/lgrthm/layout.html or go to the root of my homepage at www.tu-chemnitz.de/~luta/ and use the links PLT->Algorithms->Layout. Regards
Lutz
Tautenhahn
unread,
seat attribution
home/
lutz
.
tautenhahn
/plt/lgrthm/layout.html or go to the root of my homepage at www.tu-chemnitz.de/~luta/ and use the links PLT->Algorithms->Layout. Regards
Lutz
Tautenhahn
12/19/01
Baljit
, …
Dirk Van de moortel
12
12/7/01
Permutation algorithm for list with duplcate numbers
unread,
Permutation algorithm for list with duplcate numbers
12/7/01
Greg Rickford
, …
Lutz Tautenhahn
10
12/5/01
Bin Packing? Queueing? Scheduling? Help!
Regards,
Lutz
"Uffe Kousgaard" schrieb im Newsbeitrag news:3c0e9876$0$25412$edfadb0f@dspool01.news.tele.dk... > Hi, > > It is much better now. The only
unread,
Bin Packing? Queueing? Scheduling? Help!
Regards,
Lutz
"Uffe Kousgaard" schrieb im Newsbeitrag news:3c0e9876$0$25412$edfadb0f@dspool01.news.tele.dk... > Hi, > > It is much better now. The only
12/5/01
walker
,
Lutz Tautenhahn
2
11/25/01
Is there anyone tell me something about programming problems?Thanks
Regards,
Lutz
Tautenhahn
"walker" schrieb im Newsbeitrag news:727fd76d.0111240427.ff40244@posting.google.com... > Hello,everyone.I have to handl some dynamic
unread,
Is there anyone tell me something about programming problems?Thanks
Regards,
Lutz
Tautenhahn
"walker" schrieb im Newsbeitrag news:727fd76d.0111240427.ff40244@posting.google.com... > Hello,everyone.I have to handl some dynamic
11/25/01
SPaquin
,
Lutz Tautenhahn
2
8/15/01
Scheduling example needed
Regards,
Lutz
Tautenhahn
"SPaquin" schrieb im Newsbeitrag news:fdd7874.0108140930.17939992@posting.google.com... > Hi > I am a process control engineer
unread,
Scheduling example needed
Regards,
Lutz
Tautenhahn
"SPaquin" schrieb im Newsbeitrag news:fdd7874.0108140930.17939992@posting.google.com... > Hi > I am a process control engineer
8/15/01
Bob Bulfin
,
Lutz Tautenhahn
3
8/14/01
Linear Multiple-Choice Knapsack Problems (LMCKP)
This looks better: sum(i=1,m,j=1,n(i)) (a(i,j)-d(i))x(i,j) <= b-sum(i=1,m) d(i)
Lutz
.
unread,
Linear Multiple-Choice Knapsack Problems (LMCKP)
This looks better: sum(i=1,m,j=1,n(i)) (a(i,j)-d(i))x(i,j) <= b-sum(i=1,m) d(i)
Lutz
.
8/14/01
Richard Frost
, …
Paul A. Rubin
13
8/6/01
what problem is this?
] "
Lutz
Tautenhahn
" wrote in news:9khucn$q2b$1@narses.hrz.tu-chemnitz.de: > > I was really surprised that we even used the same symbols (dummy and > M), in
unread,
what problem is this?
] "
Lutz
Tautenhahn
" wrote in news:9khucn$q2b$1@narses.hrz.tu-chemnitz.de: > > I was really surprised that we even used the same symbols (dummy and > M), in
8/6/01
L.C.
, …
Mike Hennebry
7
8/8/01
Slow Pitch Network Problems?
unread,
Slow Pitch Network Problems?
8/8/01
Mathieu Dutour
,
Lutz Tautenhahn
2
7/17/01
Equality of 2 descriptions
unread,
Equality of 2 descriptions
7/17/01
Mathieu Dutour
,
Lutz Tautenhahn
4
7/16/01
Elimination of redundant inequalities
unread,
Elimination of redundant inequalities
7/16/01
Karlis Freivalds
, …
Lutz Tautenhahn
16
7/14/01
Hardness of non-differentiable optimization
unread,
Hardness of non-differentiable optimization
7/14/01
Frank J. Iannarilli, Jr.
, …
Lutz Tautenhahn
4
6/28/01
Q: Source of B&B, other solvers for this INLP
unread,
Q: Source of B&B, other solvers for this INLP
6/28/01
Alessandro Bellucci
, …
Paul A. Rubin
3
6/20/01
MasterMind
unread,
MasterMind
6/20/01
Pramod Bansal
, …
Lutz Tautenhahn
3
6/8/01
approximation of Normal to triangular
Hi Pramod, it seems to me you have the following problem: You have a set of data points {x_1, ..., x_n}, which are normal distributed and want them to
unread,
approximation of Normal to triangular
Hi Pramod, it seems to me you have the following problem: You have a set of data points {x_1, ..., x_n}, which are normal distributed and want them to
6/8/01
ralph mellor
, …
Lutz Tautenhahn
13
6/7/01
Would you treat this as a binary LP problem?
First, my conjecture is that only one or two nonintegers will crop up >needing rounding. is probably right (supposed you use the simplex method to solve the LP). Regards,
Lutz
Tautenhahn
unread,
Would you treat this as a binary LP problem?
First, my conjecture is that only one or two nonintegers will crop up >needing rounding. is probably right (supposed you use the simplex method to solve the LP). Regards,
Lutz
Tautenhahn
6/7/01
Jan Beldman
, …
Lutz Tautenhahn
5
6/5/01
resource-constrained project-planning
unread,
resource-constrained project-planning
6/5/01
Andrew Lee
, …
Lutz Tautenhahn
5
6/1/01
Selecting the Rth Permutation for N! pemutations
.html is too sophisticated for you , then take this one from the JavaScript in http://www.tu-chemnitz.de/~luta/plt/PermRank.html which is of O(n), too. Regards,
Lutz
.
unread,
Selecting the Rth Permutation for N! pemutations
.html is too sophisticated for you , then take this one from the JavaScript in http://www.tu-chemnitz.de/~luta/plt/PermRank.html which is of O(n), too. Regards,
Lutz
.
6/1/01
Wayne Duff-Riddell
, …
Peter Spellucci
6
5/3/01
Bounding the linear solution to an MIP.
LP's remind me of Knapsack which is NP hard, so I probably couldn't achieve the optimum solution for large problems, or am I wrong in this point?
Lutz
(the double poster).
unread,
Bounding the linear solution to an MIP.
LP's remind me of Knapsack which is NP hard, so I probably couldn't achieve the optimum solution for large problems, or am I wrong in this point?
Lutz
(the double poster).
5/3/01
Search
Clear search
Close search
Google apps
Main menu