An inverse model for the most uniform problem

DOI10.1016/j.orl.2007.03.006zbMath1151.90018OpenAlexW2148448963MaRDI QIDQ924880

Jinjiang Yuan, Qin Wang, Zhang, Jianzhong

Publication date: 29 May 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.03.006

zbMATH Keywords

computational complexityinverse optimization problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Programming in abstract spaces (90C48) Inverse problems in optimal control (49N45)

Related Items (2)

COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES ⋮ NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE

Cites Work

• Unnamed Item
• Balanced optimization problems
• Most and least uniform spanning trees
• On finding most uniform spanning trees
• Constrained balanced optimization problems
• A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• Slowing down sorting networks to obtain faster sorting algorithms
• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems

This page was built for publication: An inverse model for the most uniform problem