Top
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:
Demurrage costs optimization in ports using binary mathematical programming models
Top - Tập 3 - Trang 145-159 - 1995
SODA is a system by which the schedule of ships in a port can be found in order to minimize the demurrage and operating costs associated with shipping operations. SODA constructs and resolves binary programming models using shipping data (arrival dates, demurrage costs, berths to be used, etc.) and available berths in a planning horizon. The model is of an adjustable precision: major accuracy impl......
Strong Kuhn–Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
Top - Tập 17 - Trang 288-304 - 2008
We consider a Pareto multiobjective optimization problem with a feasible set defined by inequality and equality constraints and a set constraint, where the objective and inequality constraints are locally Lipschitz, and the equality constraints are Fréchet differentiable. We study several constraint qualifications in the line of Maeda (J. Optim. Theory Appl. 80: 483–500, 1994) and, under the weake......
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Top - Tập 27 - Trang 312-326 - 2019
The Close-Enough Arc Routing Problem, also called Generalized Directed Rural Postman Problem, is an arc routing problem with interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets within a certain distance of a meter, the receiver is able to record the gas, water, or electr......
The table placement problem: a research challenge at the EWI 2007
Top - Tập 22 - Trang 208-226 - 2012
The table placement problem consists in deciding how to seat the participants attending a social lunch or dinner so that the total social benefit of the event is maximum. Four different approaches are presented: a linear model, a bin-packing-based-approach, a quadratic assignment problem, and a greedy heuristic. The different formulations are computationally compared over a set of artificial insta......
Balanced per capita contributions and level structure of cooperation
Top - Tập 19 Số 1 - Trang 167-176 - 2011
Skeletonization for isocentre selection in Gamma Knife® Perfexion™
Top - Tập 23 - Trang 369-385 - 2014
Gamma Knife® Perfexion™ (PFX) is used for delivering radiosurgery plans to treat lesions and tumours in the brain by means of selectively ionizing the tissue with high-energy beams of radiation. An important component of designing PFX treatments is the selection of points in the target structure at which to focus the radiation, called isocentres. This study applies skeletonization methods to selec......
Note on an improved branch-and-bound algorithm to solve n/m/P/Fmax problems
Top - Tập 7 - Trang 25-31 - 1999
The LOMNICKI algorithm for n/m/P/Fmax flow-shop problems is unsuitable for large values ofn andm because of the time and size of storage required to attain an optimal solution. The form of presentation of the problem to the algorithm can influence its performance. The algorithm performance can be improved applying the algorithm to the problem and to its inverse at the same time, sharing both appli......
Nontransferable utility bankruptcy games
Top - Tập 28 - Trang 154-177 - 2019
In this paper, we analyze bankruptcy problems with nontransferable utility (NTU) from a game theoretical perspective by redefining corresponding NTU-bankruptcy games in a tailor-made way. It is shown that NTU-bankruptcy games are both coalition-merge convex and ordinally convex. Generalizing the notions of core cover and compromise stability for transferable utility (TU) games to NTU-games, we als......
Tổng số: 627
- 1
- 2
- 3
- 4
- 5
- 6
- 10