4OR
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
An optimal algorithm for variable knockout problems
4OR - - Trang 1-15
We consider a class of problems related to variable knockout, where knockout
means set a variable to zero. Given an optimisation problem formulated as a
zero–one integer program the question we consider in this paper is what might be
an appropriate set of variables to knockout of the problem, in order that the
optimal solution to the problem that remains after variable knockout has a
desired prope...
Evaluating groups with the generalized Shapley value
4OR - Tập 17 - Trang 141-172 - 2018
Following the original interpretation of the Shapley value as a priori
evaluation of the prospects of a player in a multi-person interaction situation,
we intend to apply the Shapley generalized value (introduced formally in
Marichal et al. in Discrete Appl Math 155:26–43, 2007) as a tool for the
assessment of a group of players that act as a unit in a coalitional game. We
propose an alternative a...
Matheuristics for combinatorial optimization problems: applications to services and production systems
4OR - Tập 10 - Trang 213-214 - 2011
Counting and enumeration complexity with application to multicriteria scheduling
4OR - Tập 3 - Trang 1-21 - 2005
In this paper we tackle an important point of combinatorial optimisation: that
of complexity theory when dealing with the counting or enumeration of optimal
solutions. Complexity theory has been initially designed for decision problems
and evolved over the years, for instance, to tackle particular features in
optimisation problems. It has also evolved, more or less recently, towards the
complexity...
Network synthesis under survivability constraints
4OR - Tập 2 - Trang 53-67 - 2004
Telecommunication networks are subject to link and equipment failures. Since
failures cannot be entirely avoided, networks have to be designed so as to
survive failure situations. In this paper, we are interested in designing low
cost survivable networks. Given point-to-point traffic demands and a
cost/capacity function for each link, we aim at finding the minimum cost
capacities satisfying the gi...
Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry
4OR - Tập 12 - Trang 175-197 - 2013
In this paper, a supply chain management problem from a real case study is
modeled and solved. A company in Pakistan wanted to outsource part of its
warehousing activity to a third party logistics (3PL) provider. Consequently,
the company had to decide on where to rent space in the 3PL warehouses. Knowing
that such a strategic decision is affected by tactical and operational
decisions, the problem...
Variable neighborhood search for the travelling deliveryman problem
4OR - Tập 11 - Trang 57-73 - 2012
A travelling deliveryman needs to find a tour such that the total waiting time
of all the customers he has to visit is minimum. The deliveryman starts his tour
at a depot, travelling at constant velocity. In this paper we suggest a general
variable neighborhood search based heuristic to solve this NP-hard combinatorial
optimization problem. We combine several classical neighborhood structures and
...
A decomposition approach for a very large scale optimal diversity management problem
4OR - Tập 3 - Trang 23-37 - 2005
This paper focuses on the solution of the optimal diversity management problem
formulated as a p-Median problem. The problem is solved for very large scale
real instances arising in the car industry and defined on a graph with several
tens of thousands of nodes and with several millions of arcs. The particularity
is that the graph can consist of several non connected components. This property
is u...
The development and application of metaheuristics for problems in graph theory: a computational study
4OR - Tập 10 - Trang 319-320 - 2011
Tổng số: 431
- 1
- 2
- 3
- 4
- 5
- 6
- 10