A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Theory of linear and integer programming
Theory of linear and integer programming
On an instance of the inverse shortest paths problem
Mathematical Programming: Series A and B
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
Mathematical Programming: Series A and B
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
A new degree of freedom in ATM network dimensioning: optimizing the logical configuration
IEEE Journal on Selected Areas in Communications
Merit: A unified framework for routing protocol assessment in mobile AD Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
MERIT: a scalable approach for protocol assessment
Mobile Networks and Applications
On shortest path representation
IEEE/ACM Transactions on Networking (TON)
ALGORITHMIC CHALLENGES IN LEARNING PATH METRICS FROM OBSERVED CHOICES
Applied Artificial Intelligence
Heuristic algorithms for the inverse mixed integer linear programming problem
Journal of Global Optimization
| Hi-index | 0.00 |
A general approach is presented for handling the following inverse optimization problem: given solutions to each member of a family of combinatorial optimization tasks on a common underlying set, find a positive linear objective function (weighting) on the common underlying set that simultaneously makes each solution optimal in its own optimization task. Our motivation stems from the inverse shortest path problem that is made practically important in high-speed telecommunication networks by the Asynchronous Transfer Mode Forum's Private Network-Network Interface architecture, in which route finding can be based on administrative weights. Different variants of the problem are investigated, including uniqueness requirements and reserve routes.