Graph learning assisted multi-objective integer programming
Objective-space decomposition algorithms (ODAs) are widely studied for solvingmulti-objective integer programs. However, they often encounter difficulties inhandling scalarized problems, which could cause infeasibility or repetitive nondominatedpoints and thus induce redundant runtime. To mitigate t...
Saved in:
Main Authors: | WU, Yaoxin, SONG, Wen, CAO, Zhiguang, ZHANG, Jie, GUPTA, Abhishek, LIN, Mingyan Simon |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8138 https://ink.library.smu.edu.sg/context/sis_research/article/9141/viewcontent/Learning_Generalizable_Models_for_Vehicle_Routing_Problems_via_Knowledge_Distillation__2_.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Graph learning assisted multi-objective integer programming
by: WU, Yaoxin, et al.
Published: (2022) -
Learning large neighborhood search policy for integer programming
by: WU, Yaoxin, et al.
Published: (2021) -
Learning scenario representation for solving two-stage stochastic integer programs
by: WU, Yaoxin, et al.
Published: (2022) -
Multi-view graph contrastive learning for solving vehicle routing problems
by: JIANG, Yuan, et al.
Published: (2023) -
Neural combinatorial optimization: from routing to integer programming
by: Wu, Yaoxin
Published: (2022)