位置：成果数据库 > 期刊 > 期刊详情页
Partial inverse most unbalanced spanning tree problem
  • ISSN号：0033-2097
  • 期刊名称：Przeglad Elektrotechniczny
  • 时间：2012.1.15
  • 页码：111-114
  • 相关项目：网络p-重心选址反问题的复杂性与算法研究
作者： Qin Wang|
同期刊论文项目
网络p-重心选址反问题的复杂性与算法研究
期刊论文 32 会议论文 1
同项目期刊论文
基于消费函数模型的居民消费能力与趋势的实证分析
星图上最短路改进问题的组合算法
k-supplier问题的贪婪近似算法
A generalized cholesky decomposition for interval matrix
The complexity and algorithm for minimum expense spanning trees
B-spline curve-based routing in ad hoc networks
基于Simpson公式的GM(1, N)建模的新算法
The minimum spanning subgraph problem with given cyclomatic number
Solvability and feasibility of interval linear equations and inequalities
An algorithm to transform tolerance-control solutions of interval linear equations
Construction method of constraint matrices corresponded by an optimal solution
A set of inverse telecommunication network problems
Dual–primal algorithm for linear optimization
The Inverse 1-Median Problem on Tree Networks with Variable Real Edge Lengths
Checking weak optimality of the solution to interval linear program in the general form
Generalized solutions to interval linear programmes and related necessary and sufficient optimality
Checking weak optimality of the solution to linear programming with interval right-hand side
The partial inverse minimum connected spanning subgraph problem with given cyclomatic number
复杂网络上节点重要度的确定方法
Checking strong optimality of interval linear programming with inequality constraints and nonnegativ
Localized solutions to interval linear equations
特殊圈上的逆1-maxian问题
New method for computing the upper bound of optimal value in interval quadratic program
Farkas-type theorems for interval linear systems
Checking existence of tolerance solutions of interval linear equations via mixed integer programming
Dual-primal algorithm for linear optimization
基站选址的统计理论方法研究
基于BP神经网络的智能制造系统图像识别技术
一种基于战争网络的级联失效模型