咨询与建议

限定检索结果

文献类型

  • 47 篇 期刊文献
  • 4 篇 会议
  • 3 篇 学位论文

馆藏范围

  • 54 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 42 篇 理学
    • 40 篇 数学
    • 1 篇 物理学
    • 1 篇 系统科学
  • 41 篇 管理学
    • 41 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 17 篇 工学
    • 10 篇 计算机科学与技术...
    • 4 篇 软件工程
    • 3 篇 电气工程
    • 2 篇 信息与通信工程
    • 2 篇 控制科学与工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 土木工程
    • 1 篇 石油与天然气工程
    • 1 篇 交通运输工程
  • 3 篇 经济学
    • 2 篇 应用经济学
    • 1 篇 理论经济学

主题

  • 54 篇 reformulation-li...
  • 10 篇 global optimizat...
  • 4 篇 integer programm...
  • 4 篇 cutting planes
  • 3 篇 mixed integer pr...
  • 3 篇 valid inequaliti...
  • 3 篇 lower bound
  • 3 篇 quadratic assign...
  • 3 篇 polynomial progr...
  • 3 篇 quadratically co...
  • 3 篇 traveling salesm...
  • 3 篇 branch-and-bound
  • 3 篇 steiner tree
  • 3 篇 mtz subtour elim...
  • 3 篇 semidefinite pro...
  • 2 篇 bilinear terms
  • 2 篇 mixed-integer pr...
  • 2 篇 semidefinite rel...
  • 2 篇 clustering probl...
  • 2 篇 thesis

机构

  • 4 篇 virginia polytec...
  • 3 篇 clemson univ dep...
  • 3 篇 politecn milan d...
  • 2 篇 univ tunis ecole...
  • 2 篇 virginia polytec...
  • 2 篇 univ edinburgh s...
  • 2 篇 zuse inst berlin
  • 2 篇 virginia polytec...
  • 2 篇 virginia polytec...
  • 2 篇 virginia tech | ...
  • 2 篇 auburn univ dept...
  • 2 篇 tu dortmund fak ...
  • 1 篇 city univ hong k...
  • 1 篇 ibm spain cplex ...
  • 1 篇 francis mar univ...
  • 1 篇 ctr wiskunde & i...
  • 1 篇 department of in...
  • 1 篇 king saud univ c...
  • 1 篇 bucknell univ le...
  • 1 篇 univ london impe...

作者

  • 11 篇 sherali hd
  • 4 篇 sherali hanif d.
  • 4 篇 haouari mohamed
  • 3 篇 rostami borzou
  • 3 篇 mrad mehdi
  • 3 篇 malucelli federi...
  • 3 篇 balma ali
  • 2 篇 layeb safa bhar
  • 2 篇 ganesan vikram
  • 2 篇 leggieri valeria
  • 2 篇 hahn peter m.
  • 2 篇 adams warren p.
  • 2 篇 desai j
  • 2 篇 den hertog dick
  • 2 篇 yildirim e. alpe...
  • 2 篇 tuncbilek ch
  • 2 篇 achterberg tobia...
  • 2 篇 qiu yuzhou
  • 2 篇 mao shiwen
  • 2 篇 gonzalez-rodrigu...

语言

  • 52 篇 英文
  • 2 篇 其他
检索条件"主题词=Reformulation-Linearization technique"
54 条 记 录,以下是11-20 订阅
排序:
Global Optimization of the Nonconvex Containership Design Problem Using the reformulation-linearization technique
Global Optimization of the Nonconvex Containership Design Pr...
收藏 引用
作者: Ganesan, Vikram Virginia Tech | University
The containership design problem involves optimizing a nonconvex objective function over a design space that is restricted by a set of constraints defined in terms of nonconvex functions. An application of standard no... 详细信息
来源: 评论
Integer programming approach and application of reformulation-linearization technique to liver exchange problem
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2021年 185卷 115599-115599页
作者: Yuh, Junsang Eun, Joonyup Cheong, Taesu Korea Univ Sch Ind & Management Engn Seoul 02841 South Korea Korea Univ Grad Sch Management Technol Seoul 02841 South Korea
Organ transplants are essential for many end-stage organic disease patients. Unfortunately, because of medical or biological incompatibilities, not all donors can donate to their intended recipients. These incompatibi... 详细信息
来源: 评论
On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2025年 第3期204卷 1-36页
作者: Bomze, Immanuel Peng, Bo Qiu, Yuzhou Yildirim, E. Alper Univ Vienna Fac Math & Res Network Data Sci Oskar Morgenstern Pl 1 A-1090 Vienna Austria Univ Vienna VGSCO Oskar Morgenstern Pl 1 A-1090 Vienna Austria Univ Vienna ISOR Oskar Morgenstern Pl 1 A-1090 Vienna Austria Univ Edinburgh Sch Math Peter Guthrie Tait Rd Edinburgh EH9 3FD Scotland
Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, referred to as sparse StQPs. We focus on v... 详细信息
来源: 评论
Polynomial Optimization: Tightening RLT-Based Branch-and-Bound Schemes with Conic Constraints
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2025年 第1期204卷 1-34页
作者: Gonzalez-Rodriguez, Brais Alvite-Pazo, Raul Alvite-Pazo, Samuel Ghaddar, Bissan Gonzalez-Diaz, Julio Univ Vigo Ourense Dept Stat & Operat Res Orense Galicia Spain CITMAga Galician Ctr Math Res & Technol Santiago De Compostela Galicia Spain Western Univ London Ivey Business Sch London ON Canada Univ Santiago De Compostela Dept Stat Math Anal & Optimizat Santiago De Compostela Galicia Spain Univ Santiago de Compostela MODESTYA Res Grp Santiago De Compostela Galicia Spain
This paper explores the potential of (nonlinear) conic constraints to tighten the relaxations of spatial branch-and-bound algorithms. More precisely, we contribute to the literature on the use of conic optimization fo... 详细信息
来源: 评论
Degree reduction techniques for polynomial optimization problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2025年 第2期322卷 401-413页
作者: Gonzalez-Rodriguez, Brais Naoum-Sawaya, Joe Western Univ Ivey Business Sch 1255 Western Rd London ON N6G 4W1 Canada
This paper presents anew approach to quadrify a polynomial programming problem, i.e. reduce the polynomial program to a quadratic program, before solving it. The proposed approach, QUAD-RLT, exploits the reformulation... 详细信息
来源: 评论
A polyhedral study of the generalized vertex packing problem
收藏 引用
MATHEMATICAL PROGRAMMING 2006年 第3期107卷 367-390页
作者: Sherali, HD Smith, JC Virginia Polytech Inst & State Univ Dept Ind & Syst Engn 0118 Blacksburg VA 24061 USA Univ Arizona Dept Syst & Ind Engn Tucson AZ 85721 USA
The traditional vertex packing problem defined on an undirected graph identifies the largest weighted independent set of nodes, that is, a set of nodes whose induced subgraph contains no edges. In this paper, we exami... 详细信息
来源: 评论
Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths
收藏 引用
MANAGEMENT SCIENCE 2010年 第10期56卷 1794-1814页
作者: Shen, Siqian Smith, J. Cole Ahmed, Shabbir Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA
In this paper, we consider a class of two-stage stochastic optimization problems arising in the protection of vital arcs in a critical path network. A project is completed after a series of dependent tasks are all fin... 详细信息
来源: 评论
A practical solution approach for the green vehicle routing problem
收藏 引用
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2017年 104卷 97-112页
作者: Leggieri, Valeria Haouari, Mohamed Free Univ Bozen Bolzano Fac Sci & Technol Bolzano Italy Qatar Univ Mech & Ind Engn Dept Doha Qatar
Green vehicle routing (GVRP) is an active research area that is concerned with the development and analysis of distribution activities with eco-friendly vehicles. We propose a practical solution approach for the GVRP ... 详细信息
来源: 评论
Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2019年 第2期75卷 461-494页
作者: Jiang, Rujun Li, Duan Fudan Univ Sch Data Sci Shanghai Peoples R China City Univ Hong Kong Sch Data Sci Hong Kong Peoples R China
In this paper, we present new convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. While recent research has focused on strengthening convex relaxations of QCQP using the r... 详细信息
来源: 评论
Efficient separation of RLT cuts for implicit and explicit bilinear terms
收藏 引用
MATHEMATICAL PROGRAMMING 2024年 第1期210卷 47-74页
作者: Bestuzheva, Ksenia Gleixner, Ambros Achterberg, Tobias Zuse Inst Berlin AI Soc Sci & Technol Takustr 7 D-14195 Berlin Germany HTW Berlin D-10313 Berlin Germany Gurobi GmbH Sandstr 104 D-40789 Monheim Germany
The reformulation-linearization technique (RLT) is a prominent approach to constructing tight linear relaxations of non-convex continuous and mixed-integer optimization problems. The goal of this paper is to extend th... 详细信息
来源: 评论