咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
The location-dispatching problem: Polyhedral results and content delivery network design
收藏 引用
DISCRETE APPLIED MATHEMATICS 2014年 第Part1期164卷 68-85页
作者: Chretienne, Philippe Fouilhoux, Pierre Gourdin, Eric Segura, Jean-Mathieu Univ Paris 06 Lab LIP6 F-75005 Paris France France Telecom R&D Orange Labs F-92794 Issy Les Moulineaux 9 France
Let G = (V, A) be a directed graph and F be a set of items. The Location-Dispatching Problem consists of determining subsets L-1 subset of F F located at nodes i is an element of V, minimizing the sum of two costs: a ... 详细信息
来源: 评论
The location-dispatching problem: Polyhedral results and content delivery network design
The location-dispatching problem: Polyhedral results and con...
收藏 引用
1st International Symposium on Combinatorial Optimization (ISCO)
作者: Chretienne, Philippe Fouilhoux, Pierre Gourdin, Eric Segura, Jean-Mathieu Univ Paris 06 Lab LIP6 F-75005 Paris France France Telecom R&D Orange Labs F-92794 Issy Les Moulineaux 9 France
Let G = (V, A) be a directed graph and F be a set of items. The Location-Dispatching Problem consists of determining subsets L-1 subset of F F located at nodes i is an element of V, minimizing the sum of two costs: a ... 详细信息
来源: 评论
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
收藏 引用
INFORMS JOURNAL ON COMPUTING 2013年 第1期25卷 13-26页
作者: Botton, Quentin Fortz, Bernard Gouveia, Luis Poss, Michael Catholic Univ Louvain Ctr Supply Chain Management Louvain Sch Management B-1348 Louvain Belgium Catholic Univ Louvain Ctr Operat Res & Econometr B-1348 Louvain Belgium Univ Libre Bruxelles Fac Sci Dept Comp Sci B-1050 Brussels Belgium Univ Lisbon Fac Ciencias Ctr Invest Operac Dept Estat Invest Operac P-1749016 Lisbon Portugal
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L ... 详细信息
来源: 评论
Stochastic binary problems with simple penalties for capacity constraints violations
收藏 引用
MATHEMATICAL PROGRAMMING 2013年 第1-2期138卷 199-221页
作者: Fortz, B. Labbe, M. Louveaux, F. Poss, M. Univ Libre Brussels Fac Sci Dept Comp Sci Brussels Belgium Univ Namur FUNDP Dept Business Adm Namur Belgium Univ Coimbra Dept Math CMUC P-3001454 Coimbra Portugal
This paper studies stochastic programs with first-stage binary variables and capacity constraints, using simple penalties for capacities violations. In particular, we take a closer look at the knapsack problem with we... 详细信息
来源: 评论
Polyhedral study of simple plant location problem with order
收藏 引用
OPERATIONS RESEARCH LETTERS 2013年 第2期41卷 153-158页
作者: Vasilyev, Igor Klimentova, Xenia Boccia, Maurizio Russian Acad Sci ISDCT SB RAS Inst Syst Dynam & Control Theory Siberian Branch Irkutsk 664033 Russia Univ Sannio Dipartimento Ingn I-82100 Benevento Italy
This paper is addressed to the generalization of simple plant location problem where customer's preferences are taken into account. Some basic polyhedral studies and a new family of facet-defining inequalities are... 详细信息
来源: 评论
A MIXED INTEGER LINEAR PROGRAMMING FORMULATION FOR THE SPARSE RECOVERY PROBLEM IN COMPRESSED SENSING
A MIXED INTEGER LINEAR PROGRAMMING FORMULATION FOR THE SPARS...
收藏 引用
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
作者: Karahanoglu, N. Burak Erdogan, Hakan Birbil, S. Ilker TUBITAK BILGEM Adv Technol Res Inst Kocaeli Turkey Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey
We propose a new mixed integer linear programming (MILP) formulation of the sparse signal recovery problem in compressed sensing (CS). This formulation is obtained by introduction of an auxiliary binary vector, where ... 详细信息
来源: 评论
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
收藏 引用
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION 2013年 第3-4期1卷 283-312页
作者: Groiez, Mounira Desaulniers, Guy Hadjar, Ahmed Marcotte, Odile Ecole Polytechn Montreal Dept Math & Genie Ind Montreal PQ H3C 3A7 Canada Gerad Montreal PQ H3C 3A7 Canada Kronos Canadian Syst Inc Montreal PQ H3V 1H8 Canada Univ Quebec Montreal Dept Informat CP 8888Succ Ctr Ville Montreal PQ H3C 3P8 Canada Gerad Montreal PQ H3C 3P8 Canada
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particula... 详细信息
来源: 评论
Solving VLSI design and DNA sequencing problems using bipartization of graphs
收藏 引用
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2012年 第2期51卷 749-781页
作者: Fouilhoux, Pierre Mahjoub, A. Ridha Univ Paris 09 LAMSADE CNRS F-75775 Paris 16 France Univ Paris 06 Lab LIP6 CNRS UMR 7626 F-75005 Paris France
In this paper we consider the 2-layer constrained via minimization problem and the SNP haplotype assembly problem. The former problem arises in the design of integrated and printed circuit boards, and the latter comes... 详细信息
来源: 评论
Exact algorithms for Cluster Editing: Evaluation and Experiments
收藏 引用
algorithmICA 2011年 第2期60卷 316-334页
作者: Boecker, Sebastian Briesemeister, Sebastian Klau, Gunnar W. Univ Jena Inst Informat Jena Germany Jena Ctr Bioinformat Jena Germany Univ Tubingen Div Simulat Biol Syst ZBIT WSI Tubingen Germany CWI NL-1090 GB Amsterdam Netherlands
The Cluster Editing problem is defined as follows: Given an undirected, loopless graph, we want to find a set of edge modifications (insertions and deletions) of minimum cardinality, such that the modified graph consi... 详细信息
来源: 评论
Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2011年 第2期61卷 422-429页
作者: Lacroix, Mathieu Mahjoub, A. Ridha Martin, Sebastien Univ Paris 09 LAMSADE F-75775 Paris 16 France Univ Blaise Pascal Clermont Ferrand II LIMOS F-63177 Aubiere France
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This problem consists, given a conditional differential-algebraic system, in verifying if the sy... 详细信息
来源: 评论