Abstract
Two examples of parametric cost programming problems—one in network programming and one in NP-hard 0-1 programming—are given; in each case, the number of breakpoints in the optimal cost curve is exponential in the square root of the number of variables in the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have