Abstract: This paper considers personalized mixed-integer programming problems (MIPs) with global coupled constraints, where each cost function is associated with both local and global decisions. In ...
Abstract: The rooted max tree coverage (MTC) problem has wide applications in areas, such as network design and vehicle routing. Given a graph with non-negative costs defined on edges, a vertex used ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback