咨询与建议

限定检索结果

文献类型

  • 86 篇 期刊文献
  • 14 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 70 篇 管理学
    • 69 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 58 篇 工学
    • 38 篇 计算机科学与技术...
    • 9 篇 软件工程
    • 6 篇 电气工程
    • 6 篇 交通运输工程
    • 4 篇 信息与通信工程
    • 3 篇 土木工程
    • 2 篇 机械工程
    • 1 篇 动力工程及工程热...
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 环境科学与工程(可...
  • 53 篇 理学
    • 49 篇 数学
    • 2 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 8 篇 经济学
    • 4 篇 应用经济学
    • 3 篇 理论经济学
  • 1 篇 军事学

主题

  • 102 篇 branch-and-cut a...
  • 10 篇 integer programm...
  • 7 篇 valid inequaliti...
  • 5 篇 combinatorial op...
  • 4 篇 routing
  • 4 篇 mixed-integer li...
  • 4 篇 safe set problem
  • 4 篇 vehicle routing
  • 4 篇 benders decompos...
  • 3 篇 traveling salesm...
  • 3 篇 branch-and-bound...
  • 3 篇 facets
  • 3 篇 polytope
  • 3 篇 weighted safe se...
  • 3 篇 cdn design
  • 3 篇 polyhedral study
  • 3 篇 integer linear p...
  • 3 篇 network design
  • 3 篇 mixed integer li...
  • 3 篇 location

机构

  • 3 篇 univ paris 06 la...
  • 2 篇 univ libre bruxe...
  • 2 篇 univ estadual ca...
  • 2 篇 france telecom r...
  • 2 篇 univ brescia dep...
  • 2 篇 univ fed flumine...
  • 2 篇 hec montreal mon...
  • 2 篇 univ coll dublin...
  • 2 篇 kedge business s...
  • 2 篇 ras ivannikov in...
  • 1 篇 univ bonn inst c...
  • 1 篇 univ liverpool s...
  • 1 篇 univ santiago ch...
  • 1 篇 johannes gutenbe...
  • 1 篇 tsinghua univ de...
  • 1 篇 ecole polytech c...
  • 1 篇 univ fed rio de ...
  • 1 篇 essec business s...
  • 1 篇 univ tehran med ...
  • 1 篇 beijing univ tec...

作者

  • 5 篇 mahjoub a. ridha
  • 5 篇 fouilhoux pierre
  • 4 篇 gourdin eric
  • 4 篇 speranza m. graz...
  • 4 篇 gouveia luis
  • 3 篇 simonetti luidi
  • 3 篇 bianchessi nicol...
  • 3 篇 laporte gilbert
  • 3 篇 malaguti enrico
  • 3 篇 fortz bernard
  • 3 篇 segura jean-math...
  • 2 篇 labbe martine
  • 2 篇 salazar-gonzalez...
  • 2 篇 laporte g
  • 2 篇 karaoglan ismail
  • 2 篇 de souza c. c.
  • 2 篇 corberan angel
  • 2 篇 simonetti l.
  • 2 篇 archetti claudia
  • 2 篇 plana isaac

语言

  • 90 篇 英文
  • 11 篇 其他
检索条件"主题词=Branch-and-Cut Algorithm"
102 条 记 录,以下是21-30 订阅
排序:
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2024年 第2期316卷 473-487页
作者: Barbato, Michele Gouveia, Luis Univ Milan Dipartimento Informat Giovanni Degli Antoni Via Celoria 18 I-20133 Milan Italy Univ Lisbon Fac Ciencias Ctr Matemat Aplicacoes Fundamentais & Invest Opera C6 Piso 4 P-1749016 Lisbon Portugal
In this paper we study the Hamiltonian p-median problem, in which we are given an edge-weighted graph and we are asked to determine p vertex-disjoint cycles spanning all vertices of the graph and having minimum total ... 详细信息
来源: 评论
A branch-and-cut algorithm for the capacitated profitable tour problem
收藏 引用
DISCRETE OPTIMIZATION 2014年 14卷 78-96页
作者: Jepsen, Mads Kehlet Petersen, Bjorn Spoorendonk, Simon Pisinger, David Tech Univ Denmark DTU Management Engn DK-2800 Lyngby Denmark
This paper considers the Capacitated Profitable Tour Problem (CPTP) which is a special case of the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). The CPTP belongs to the group of problems known a... 详细信息
来源: 评论
Discrete cutting path problems: a general solution framework and industrial applications
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2025年 第3期63卷 949-969页
作者: Khachai, Daniil Battaia, Olga Petunin, Alexander Khachay, Michael Kedge Business Sch 680 Cours Liberat Talence France Ural Fed Univ Ekaterinburg Russia NN Krasovskii Inst Math & Mech Ekaterinburg Russia RAS Ivannikov Inst Syst Programming Moscow Russia
The optimal tool routing for cutting machines, also known as cutting path optimisation is an important problem in production research. This problem is relevant in various manufacturing environments such as aeronautic,... 详细信息
来源: 评论
Optimization algorithms for the k edge-connected L-hop-constrained network design problem
收藏 引用
SOFT COMPUTING 2024年 第11-12期28卷 7201页
作者: Diarrassouba, I. Mahjoub, A. R. Almudahka, I. M. Normandie Univ UNIHAVRE LMAH FR 3335CNRS F-76600 Le Havre France Kuwait Univ Coll Sci Dept Stat & Operat Res Kuwait Kuwait Univ Paris 09 Lab LAMSADE CNRSUMR 7243 PSL Pl Marechal Lattre Tassigny F-75775 Paris 16 France
In this paper, we study the k edge-connected L-hop-constrained network design problem. Given a weighted graph G=(V,E), a set D of pairs of nodes, two integers L >= 2 and k >= 2, the problem consists in finding a... 详细信息
来源: 评论
Beyond symmetry: best submatrix selection for the sparse truncated SVD
收藏 引用
MATHEMATICAL PROGRAMMING 2024年 第1-2期208卷 1-50页
作者: Li, Yongchun Xie, Weijun Georgia Inst Technol Atlanta GA 30332 USA
The truncated singular value decomposition (SVD), also known as the best low-rank matrix approximation with minimum error measured by a unitarily invariant norm, has been applied to many domains such as biology, healt... 详细信息
来源: 评论
The family capacitated vehicle routing problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2024年 第3期314卷 836-853页
作者: Bernardino, Raquel Paias, Ana Univ Lisbon ISEG Sch Econ & Management Lisbon Portugal CEMAPRE REM Res Econ & Math Lisbon Portugal Univ Lisbon Fac Ciencias DEIO C6Piso 4 P-1749016 Lisbon Portugal Univ Lisbon Fac Ciencias CMAFcIO Lisbon Portugal
In this article, we address the family capacitated vehicle routing problem (F-CVRP), an NP-hard problem that generalizes both the FTSP and the capacitated vehicle routing problem. The F-CVRP has practical application ... 详细信息
来源: 评论
Customized bus scheme design of large transport terminals with jointly optimization of departure time, vehicle allocation and routing
收藏 引用
IET INTELLIGENT TRANSPORT SYSTEMS 2023年 第1期17卷 85-101页
作者: Wu, Yuelin Yuan, Zhenzhou Xiao, Qingyu Yang, Dong Beijing Jiaotong Univ Sch Traff & Transportat Key Lab Transport Ind Big Data Applicat Technol C Minist Transport 3 Shangyuan Village Beijing 100044 Peoples R China China Acad Transportat Sci Ctr Comprehens Transportat Beijing Peoples R China
The customized bus (CB) service of large transport terminals can provide passengers with convenient transfers and door-to-door services, which has the potential to help ease the pressure of arriving passenger flow in ... 详细信息
来源: 评论
Models and algorithms for the Weighted Safe Set Problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期329卷 23-34页
作者: Malaguti, Enrico Pedrotti, Vagner Univ Bologna Dipartimento Ingn Energia Elettr & Informaz Guglie Bologna Italy Univ Fed Mato Grosso Fac Comp Campo Grande Brazil
Given a connected graph G = (V, E), a Safe Set S is a subset of the vertex set V such that the cardinality of each connected component in the subgraph induced by V \S does not exceed the cardinality of any neighbor co... 详细信息
来源: 评论
The inventory routing problem with split deliveries
收藏 引用
NETWORKS 2023年 第4期82卷 400-413页
作者: Dinh, Nho Minh Archetti, Claudia Bertazzi, Luca Univ Brescia Dept Econ & Management Brescia Italy ESSEC Business Sch Dept Informat Syst Decis Sci & Stat Paris France
We study the benefit of introducing split deliveries in the inventory routing problem (IRP), both when the order-up-to level (OU) and the maximum level replenishment policies are applied. We first propose a mathematic... 详细信息
来源: 评论
Multi-Objective Trip Planning With Solution Ranking Based on User Preference and Restaurant Selection
收藏 引用
IEEE ACCESS 2022年 10卷 10688-10705页
作者: Choachaicharoenkul, Supoj Coit, David Wattanapongsakorn, Naruemon King Mongkuts Univ Technol Thonburi Fac Engn Dept Comp Engn Bangkok 10140 Thailand Rutgers State Univ Dept Ind & Syst Engn Piscataway NJ 08854 USA Tsinghua Univ Dept Ind Engn Beijing 100190 Peoples R China
The tourist trip design problem (TTDP) helps the trip planners, such as tourists, tour companies, and government agencies, automate their trip planning. TTDP solver chooses and sequences an optimal subset of point of ... 详细信息
来源: 评论