Shortest chain subject to side constraints

@article{Aneja1983ShortestCS,
  title={Shortest chain subject to side constraints},
  author={Yash P. Aneja and V. Aggarwal and Kunhiraman Nair},
  journal={Networks},
  year={1983},
  volume={13},
  pages={295-302}
}
A shortest chain from a source to a sink in a general network is of interest in many ways [3, 41 and efficient algorithms are available for finding such a chain. In certain contexts side constraints on travel time, energy, or other resources consumed along the chain may be relevant. The shortest-chain problem subject to side constraints is known to be NP-complete. Moreover, the constraint matrix is not unimodular, and therefore a linear programming algorithm would not, in general, guarantee an… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
58 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Linear Multiobjective Programming

  • M. Zeleny
  • 1974

Principles o f Operations Research

  • H. M. Wagner
  • 1969

Similar Papers

Loading similar papers…