2 METHODS OF SOLVING PROBLEMS OF PRECEDENCE CONSTRAINTS

被引:0
|
作者
KOLNIKOVA, Z [1 ]
机构
[1] SVST,USTAV EKON ORG STROJARENSKEJ VYROBY,BRATISLAVA,CZECHOSLOVAKIA
来源
EKONOMICKO-MATEMATICKY OBZOR | 1970年 / 6卷 / 01期
关键词
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
引用
收藏
页码:56 / 72
页数:17
相关论文
共 50 条
  • [41] SOLVING OPTIMIZATION PROBLEMS WITH PROPORTION-CONSTRAINTS
    ROTHBLUM, UG
    MATHEMATICAL PROGRAMMING, 1978, 15 (01) : 77 - 86
  • [42] Solving routing problems with pairwise synchronization constraints
    Parragh, Sophie N.
    Doerner, Karl F.
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2018, 26 (02) : 443 - 464
  • [43] SOLVING NETWORK MANPOWER PROBLEMS WITH SIDE CONSTRAINTS
    PRICE, WL
    GRAVEL, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (02) : 196 - 202
  • [44] Solving various weighted matching problems with constraints
    Caseau, Y
    Laburthe, F
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 97, 1997, 1330 : 17 - 31
  • [45] Solving Symbolic Regression Problems with Formal Constraints
    Bladek, Iwo
    Krawiec, Krzysztof
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 977 - 984
  • [46] A parallel solving algorithm for quantified constraints problems
    Vautard, Jeremie
    Lallouet, Arnaud
    Hamadi, Youssef
    22ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2010), PROCEEDINGS, VOL 1, 2010,
  • [47] Solving large replacement problems with budget constraints
    2000, Bellwether Publishing, Ltd. (45):
  • [48] Solving routing problems with pairwise synchronization constraints
    Sophie N. Parragh
    Karl F. Doerner
    Central European Journal of Operations Research, 2018, 26 : 443 - 464
  • [49] Solving Various Weighted Matching Problems with Constraints
    Caseau Y.
    Laburthe F.
    Constraints, 2000, 5 (1-2) : 141 - 160
  • [50] Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming
    Hande Y. Benson
    Robert J. Vanderbei
    Mathematical Programming, 2003, 95 : 279 - 302