Abstract
In this chapter we introduce the network flow problem and the graph matching problem as two special integer programs and we shortly discuss the relevance of these standard problems in Operations Research. A closer look at the structure of the constraint matrix of both problems leads to a common generalization: the general matching problem in bidirected graphs.KeywordsInteger Linear ProgramNetwork FlowMatch ProblemNetwork Flow ProblemBidirected GraphThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
