A polynomially solvable case of optimal linear extension problem of a poset

被引：0

作者：

Biao Wu

Enyu Yao

Longcheng Liu

机构：

[1] Zhejiang University,Department of Mathematics

[2] Xiamen University,School of Mathematical Sciences

来源：

Journal of Combinatorial Optimization | 2010年 / 20卷

关键词：

Poset; Linear extension; Optimization;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper, we consider an optimal linear extension problem of partial order. Under certain conditions, we prove the problem is polynomially solvable and present an algorithm to compute the solution.

引用

页码：422 / 428

页数：6

共 50 条

[31] An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
Kurpisz, Adam
Leppanen, Samuli
Mastrolilli, Monaldo
MATHEMATICAL PROGRAMMING, 2017, 166 (1-2) : 1 - 17
[32] On polynomially solvable constrained input selections for fixed and switched linear structured systems
Zhang, Yuan
Xia, Yuanqing
Liu, Shenyu
Sun, Zhongqi
AUTOMATICA, 2023, 158
[33] On verification and design of input matrix for robust linear systems: Complexity and polynomially solvable cases
Dey, Priyanka
EUROPEAN JOURNAL OF CONTROL, 2024, 79
[34] The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases
Punnen, Abraham P.
Sripratak, Piyashat
Karapetyan, Daniel
DISCRETE APPLIED MATHEMATICS, 2015, 193 : 1 - 10
[35] Some Polynomially Solvable Cases of the Inverse Ordered 1-Median Problem on Trees
Kien Trung Nguyen
FILOMAT, 2017, 31 (12) : 3651 - 3664
[36] New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
Kabadi, SN
DISCRETE APPLIED MATHEMATICS, 2002, 119 (1-2) : 149 - 167
[37] A Polynomially Solvable Case of Scheduling Multiprocessor Tasks in a Multi-Machine Environment
Xin, Xiao
Mou, Min
Mu, Guohua
PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, MACHINERY AND ENERGY ENGINEERING (MSMEE 2017), 2017, 123 : 1746 - 1749
[38] Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
Eranda Çela
Bettina Klinz
Christophe Meyer
Journal of Combinatorial Optimization, 2006, 12 : 187 - 215
[39] Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
Cela, Eranda
Klinz, Bettina
Meyer, Christophe
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 12 (03) : 187 - 215
[40] A SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM
GILMORE, PC
CANADIAN MATHEMATICAL BULLETIN, 1966, 9 (06): : 743 - &

← 1 2 3 4 5 →