Math Forum / Mathematics / Operations Research / January 2006

I am currently in the process of implementing a branch-and-price algorithm
and since I would hate to reinvent the wheel, I have been browsing the net
and this newsgroup to look for an appropriate framework that I could use to
manage my search tree, search strategies, branching, etc. ...

There is no error when I compile the source, but when I try to build
it, during linking process,
I got the following error message.
error LNK2001: unresolved external symbol "protected: struct

Hello, All!
Suppose we have any rectangular matrixes F, H, B and some positive
definite, symmetric matrixes Q_1, Q_2. Let us set
       d=F'z+H'u

Hello, All!
Let us denote by F,H,B some rectangular matrixes.
We'll suppose that q_i, i=1,2 is positive symmetric bilinear form i.e.
       q_i(x,y)=q_i(y,x), q_i(x,x)>0 if x\ne 0 i=1,2

A quick question about cplex. Is there any command line method of solving LP/MIP problems through cplex, without going into the interactive session?
In other words, I don't want to go to cplex interactive session, read each problem, solve them and then print solution. Is there a ...

i am working on a routing module of a navigation system on pocket pc.I
found Dijkstra algorithm the best for calculating the shortest path
between two nodes (start and end points).Since pocket pc has a limited
memory space and graph size may go to n size depending upon the

I am trying a decomposition procedure for a certain OR problem. A
master problem and several slave problems have been created in
OPLScript. The first has been formulated as a CP problem. The solution
of slave problems must be entered in form of constraints to the master

Hello, All!
I'd like to ask a simple question. Here it is.
Let us denote by Q some nonnegative symmetric matrix,
F - some rectangular matrix,

From:  Thomas L. Jones
Subj:  Optimizing a queued system using Lagrangian relaxation
I am keenly interested in a class of nonlinear optimization problems
which can be solved (approximately solved?) using Lagrangian

I am looking for more information on the following problem, or a paper
dealing with it. It sounds like a fairly common problem.
There are n jobs to be scheduled on a single machine. Each job j(i) has
a processing time p(i). Only one job can be processed at a time.

I need help in solvin this problem. I am doing a study in Markov chain
and
need help in this . Plz help me if anyone knows about it.
Suppose A and B play a sequence of snooker games. The first player to

Guys,
Can anyone suggest a website/newsgroup (other than this) where I can
get information on operations research conferences conducted in India.
Schedules and other stuff.

  I am now an INFORMS member.   I would like to receive the emails
from some INFORMS Sub-divisions, such as computing and MSOM.   How can
I get them?
Thanks a lot.

I have a question about approximation of the ratio of integral and
fractional vertex of a polyhedron. Concisely, given a linear program Ax <=
b, and A is totally unimodular, which means all the vertices are to be
integral if b is an integer vector. And now, some inequalities are ...

A newbie to operations research, faced with probably a simple question
for most. Why are open contraints ( < and > ) not used in Lp?