THEORY AND ALGORITHMS FOR LINEAR MULTIPLE OBJECTIVE PROGRAMS WITH ZERO-ONE VARIABLES

被引：67

|

作者：

BITRAN, GR

机构：

来源：

MATHEMATICAL PROGRAMMING | 1979年 / 17卷 / 03期

关键词：

D O I：

10.1007/BF01588256

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：362 / 390

页数：29

相关论文

共 50 条

[41] USING ZERO-ONE VARIABLES WITH TIME-SERIES DATA IN REGRESSION EQUATIONS
TOMEK, WG
JOURNAL OF FARM ECONOMICS, 1963, 45 (04): : 814 - 822
[42] ONE-TIME DUMMIES - ZERO-ONE DUMMY VARIABLES WHICH TAKE ON ONLY ONE NON-ZERO VALUE
SWAN, C
CASSIDY, HJ
JOURNAL OF ECONOMICS AND BUSINESS, 1975, 27 (03) : 268 - 271
[43] REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING
WATTERS, LJ
OPERATIONS RESEARCH, 1967, 15 (06) : 1171 - &
[44] ZERO-ONE LAWS AND WEAK CONVERGENCES FOR SUMS OF INDEPENDENT RANDOM-VARIABLES
SIEGEL, G
MATHEMATISCHE NACHRICHTEN, 1978, 86 : 333 - 346
[45] A Linear Zero-One Formulation of Optimal Power Allocation of IDMA Systems
Lau, Mark S. K.
Yue, Wuyi
2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 637 - +
[46] A Brand-New Algorithm for Zero-one Integer Linear Programming
Zhao Ning
Mi Weijian
Mi Chao
2011 3RD WORLD CONGRESS IN APPLIED COMPUTING, COMPUTER SCIENCE, AND COMPUTER ENGINEERING (ACC 2011), VOL 4, 2011, 4 : 550 - 556
[47] TOOLS FOR REFORMULATING LOGICAL FORMS INTO ZERO-ONE MIXED-INTEGER PROGRAMS
MITRA, G
LUCAS, C
MOODY, S
HADJICONSTANTINOU, E
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (02) : 262 - 276
[48] EFFICIENT ALGORITHMS FOR SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS TO OPTIMALITY
GAVISH, B
PIRKUL, H
MATHEMATICAL PROGRAMMING, 1985, 31 (01) : 78 - 105
[49] A BOUND AND BOUND ALGORITHM FOR THE ZERO-ONE MULTIPLE KNAPSACK-PROBLEM
MARTELLO, S
TOTH, P
DISCRETE APPLIED MATHEMATICS, 1981, 3 (04) : 275 - 288
[50] SOLVING MULTIPLE OBJECTIVE LINEAR-PROGRAMS IN OBJECTIVE SPACE
DAUER, JP
LIU, YH
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (03) : 350 - 357

← 1 2 3 4 5 →