CONIC

作品数:71被引量:64H指数:4
导出分析报告
相关领域:理学更多>>
相关作者:刘小平徐少平李春泉胡凌燕杨晓辉更多>>
相关机构:安徽大学南昌大学东北师范大学加拿大卡尔顿大学更多>>
相关期刊:更多>>
相关基金:国家自然科学基金国家高技术研究发展计划江西省自然科学基金广东省自然科学基金更多>>
-

检索结果分析

结果分析中...
选择条件:
  • 期刊=Journal of the Operations Research Society of Chinax
条 记 录,以下是1-3
视图:
排序:
An Enhanced Conic Reformulation for Capacity-Constrained Assortment Optimization Under the Mixture of Multinomial Logit Model
《Journal of the Operations Research Society of China》2024年第3期757-771,共15页Shan Jiang Ka-Meng Nip 
supported by the Fundamental Research Funds for the Central Universities of Xiamen University(No.2072021127);Ka-Meng Nip’s research work is partially supported by the Natural Science Foundation of Fujian Province of China(No.2021J05011);the Fundamental Research Funds for the Central Universities of Xiamen University(No.20720210033).
In this work,we study the conic quadratic mixed-integer formulation for assortment optimization problem under the mixture of multinomial logit(MMNL)model.The MMNL model generalizes the widely studied multinomial logit...
关键词:Assortment optimization MMNL model Conic reformulation Capacitated constrained 
Conic Scalarizations for Approximate Efficient Solutions in Nonconvex Vector Optimization Problems
《Journal of the Operations Research Society of China》2017年第3期419-430,共12页Hui Guo Wan-li Zhang 
the National Natural Science Foundation of China(No.11301574);Chongqing Municipal Education Commission(No.KJ1500310);the Doctor Startup Fund of Chongqing Normal University(No.16XLB010).
Nonlinear scalarization is a very important method to deal with the vector optimization problems.In this paper,some conic nonlinear scalarization characterizations of E-optimal points,weakly E-optimal points,and E-Be...
关键词:Improvementset E-optimal points Weakly E-optimal points E-Benson properlyefficientpoints Nonlinear scalarization 
Exact Computable Representation of Some Second-Order Cone Constrained Quadratic Programming Problems被引量:1
《Journal of the Operations Research Society of China》2013年第1期107-134,共28页Qingwei Jin Ye Tian Zhibin Deng Shu-Cherng Fang Wenxun Xing 
supported by US Army Research Office Grant(No.W911NF-04-D-0003);by the North Carolina State University Edward P.Fitts Fellowship and by National Natural Science Foundation of China(No.11171177)。
Solving the quadratically constrained quadratic programming(QCQP)problem is in general NP-hard.Only a few subclasses of the QCQP problem are known to be polynomial-time solvable.Recently,the QCQP problem with a noncon...
关键词:Linear conic program Semidefinite program Nonconvex quadratically constrained quadratic program Second-order cone 
检索报告 对象比较 聚类工具 使用帮助 返回顶部