咨询与建议

限定检索结果

文献类型

  • 24 篇 期刊文献
  • 2 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 16 篇 管理学
    • 16 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 13 篇 理学
    • 13 篇 数学
  • 11 篇 工学
    • 8 篇 计算机科学与技术...
    • 4 篇 电气工程
    • 1 篇 信息与通信工程
    • 1 篇 控制科学与工程
    • 1 篇 航空宇航科学与技...
  • 4 篇 经济学
    • 4 篇 应用经济学

主题

  • 26 篇 suboptimal algor...
  • 15 篇 analysis of algo...
  • 4 篇 combinatorial pr...
  • 3 篇 computational co...
  • 3 篇 sequencing
  • 3 篇 production/sched...
  • 3 篇 marketing
  • 3 篇 online
  • 3 篇 deterministic
  • 2 篇 bin packing
  • 2 篇 choice models
  • 2 篇 multiple machine
  • 2 篇 scheduling
  • 1 篇 approximations/h...
  • 1 篇 greedy-heuristic
  • 1 篇 energy-efficient...
  • 1 篇 gmti radar
  • 1 篇 assortment optim...
  • 1 篇 greedy algorithm...
  • 1 篇 target tracking ...

机构

  • 3 篇 columbia univ gr...
  • 2 篇 mit operat res c...
  • 2 篇 mit cambridge ma...
  • 2 篇 univ navarra ies...
  • 1 篇 mit alfred p slo...
  • 1 篇 univ chicago boo...
  • 1 篇 natl univ singap...
  • 1 篇 attila jozsef un...
  • 1 篇 andro computat s...
  • 1 篇 renmin univ chin...
  • 1 篇 cwi
  • 1 篇 washington univ ...
  • 1 篇 royal holloway u...
  • 1 篇 ecole mines dept...
  • 1 篇 ibm corp thomas ...
  • 1 篇 purdue univ sch ...
  • 1 篇 tu graz inst mat...
  • 1 篇 graz tech univ i...
  • 1 篇 polytech univ me...
  • 1 篇 mit dept civil &...

作者

  • 3 篇 woeginger g
  • 2 篇 topaloglu huseyi...
  • 2 篇 galambos g
  • 2 篇 ma will
  • 2 篇 simchi-levi davi...
  • 2 篇 kellerer h
  • 1 篇 loe richard
  • 1 篇 vanlaarhoven pjm
  • 1 篇 hertz a
  • 1 篇 wagner laura
  • 1 篇 lenstra jk
  • 1 篇 wein jm
  • 1 篇 chen yiwei
  • 1 篇 rajagopalan s
  • 1 篇 martinez-de-albe...
  • 1 篇 williamson dp
  • 1 篇 rusmevichientong...
  • 1 篇 wang xinshang
  • 1 篇 saberi amin
  • 1 篇 dawande milind

语言

  • 26 篇 英文
检索条件"主题词=suboptimal algorithms"
26 条 记 录,以下是21-30 订阅
排序:
Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2024年 第2期49卷 1169-1191页
作者: Blanchard, Moise Jacquillat, Alexandre Jaillet, Patrick MIT Cambridge MA 02139 USA
This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher ap... 详细信息
来源: 评论
Simple Policies for Dynamic Pricing with Imperfect Forecasts
收藏 引用
OPERATIONS RESEARCH 2013年 第3期61卷 612-624页
作者: Chen, Yiwei Farias, Vivek F. Renmin Univ China Sch Business Beijing 100872 Peoples R China MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA
We consider the "classical" single-product dynamic pricing problem allowing the "scale" of demand intensity to be modulated by an exogenous "market size" stochastic process. This is a nat... 详细信息
来源: 评论
Inventory Balancing with Online Learning
收藏 引用
MANAGEMENT SCIENCE 2022年 第3期68卷 1776-1807页
作者: Cheung, Wang Chi Ma, Will Simchi-Levi, David Wang, Xinshang Natl Univ Singapore Dept Ind Syst Engn & Management Singapore 117576 Singapore Columbia Univ Grad Sch Business New York NY 10027 USA MIT Inst Data Syst & Soc Dept Civil & Environm Engn 77 Massachusetts Ave Cambridge MA 02139 USA MIT Operat Res Ctr 77 Massachusetts Ave Cambridge MA 02139 USA Alibaba Grp US San Mateo CA 94402 USA Shanghai Jiao Tong Univ Antai Coll Econ & Management Shanghai 200240 Peoples R China
We study a general problem of allocating limited resources to heterogeneous customers over time under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically cons... 详细信息
来源: 评论
Assortment Optimization Under the Multinomial Logit Model with Utility-Based Rank Cutoffs
收藏 引用
OPERATIONS RESEARCH 2024年 第4期72卷 1453-1474页
作者: Bai, Yicheng Feldman, Jacob Topaloglu, Huseyin Wagner, Laura Cornell Tech Sch Operat Res & Informat Engn New York NY 10044 USA Washington Univ Olin Business Sch St Louis MO 63130 USA Univ Navarra IESE Business Sch Barcelona 08034 Spain
We study assortment optimization problems under a natural variant of the multinomial logit model where the customers are willing to focus only on a certain number of products that provide the largest utilities. In par... 详细信息
来源: 评论
A unifying look at sequence submodularity
收藏 引用
ARTIFICIAL INTELLIGENCE 2021年 297卷 103486-103486页
作者: Bernardini, Sara Fagnani, Fabio Piacentini, Chiara Royal Holloway Univ London Dept Comp Sci Egham TW20 0EX Surrey England Politecn Torino Dept Math Sci I-10129 Turin Italy Augmenta Inc Toronto ON M5A 1E1 Canada
Several real-world problems in engineering and applied science require the selection of sequences that maximize a given reward function. Optimizing over sequences as opposed to sets requires exploring an exponentially... 详细信息
来源: 评论
Edge coloring a k‐tree into two smaller trees
收藏 引用
Networks 1998年 第4期29卷
作者: Dilip Chhajed Department of Business Administration University of Illinois at Urbana‐Champaign 350 Commerce West Building Champaign Illinois 61820
The problem of the edge coloring partial k ‐tree into two partial p ‐ and q ‐trees with p , q < k is considered. An algorithm is provided to construct such a coloring with p + q = k . Usefulness of this result i... 详细信息
来源: 评论