New algorithm for the min-max problem with nonlinear constraints

被引：0
|
作者：
Shang, Jincheng
Zang, Yongchuan
Du, Jiang
Yu, Yin
机构：
来源：
Huazhong Ligong Daxue Xuebao/Journal Huazhong (Central China) University of Science and Technology | 1996年 / 24卷 / Suppl 1期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] New Genetic Algorithm for Min-Max Vehicle Routing Problem
    Ren, Chunyu
    INFORMATION AND BUSINESS INTELLIGENCE, PT II, 2012, 268 : 21 - 27
  • [2] A nonmonotonic hybrid algorithm for min-max problem
    Fusheng Wang
    Jinbao Jian
    Optimization and Engineering, 2014, 15 : 909 - 925
  • [3] A nonmonotonic hybrid algorithm for min-max problem
    Wang, Fusheng
    Jian, Jinbao
    OPTIMIZATION AND ENGINEERING, 2014, 15 (04) : 909 - 925
  • [4] Min-max inequalities and the timing verification problem with max and linear constraints
    Cheng, YP
    Zheng, DZ
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2005, 15 (02): : 119 - 143
  • [5] Research on New Tabu Search Algorithm for Min-Max Vehicle Routing Problem
    Ren, Chunyu
    ADVANCED RESEARCH ON COMPUTER EDUCATION, SIMULATION AND MODELING, PT I, 2011, 175 : 79 - 84
  • [6] Min-max and min-max (relative) regret approaches to representatives selection problem
    Dolgui, Alexandre
    Kovalev, Sergey
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
  • [7] Handling the Constraints in Min-Max MPC
    Hu, Jianchen
    Lv, Xiaoliang
    Pan, Hongguang
    Zhang, Meng
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024, 21 (01) : 296 - 304
  • [8] An algorithm for the inequality-constrained discrete min-max problem
    Rustem, B
    Nguyen, Q
    SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (01) : 265 - 283
  • [9] A simple algorithm and min-max formula for the inverse arborescence problem
    Frank, Andras
    Hajdu, Gergely
    DISCRETE APPLIED MATHEMATICS, 2021, 295 : 85 - 93
  • [10] Applying Genetic Algorithm for Min-Max Vehicle Routing Problem
    Ren, Chunyu
    ADVANCED TRANSPORTATION, PTS 1 AND 2, 2011, 97-98 : 640 - 643
12345