GLORIA

GEOMAR Library Ocean Research Information Access

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (142)
  • 2010-2014  (142)
Document type
  • Articles  (142)
Source
Publisher
Years
Year
Journal
Topic
  • 1
    facet.materialart.
    Unknown
    Unified matheuristic for solving rich vehicle routing problems (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-12-11
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 2
    facet.materialart.
    Unknown
    Acknowledgement to referees (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-11-27
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    Simulation optimization: a review of algorithms and applications (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-11-14
    Description: Simulation optimization refers to the optimization of an objective function subject to constraints, both of which can be evaluated through a stochastic simulation. To address specific features of a particular simulation—discrete or continuous decisions, expensive or cheap simulations, single or multiple outputs, homogeneous or heterogeneous noise—various algorithms have been proposed in the literature. As one can imagine, there exist several competing algorithms for each of these classes of problems. This document emphasizes the difficulties in simulation optimization as compared to algebraic model-based mathematical programming makes reference to state-of-the-art algorithms in the field, examines and contrasts the different approaches used, reviews some of the diverse applications that have been tackled by these methods, and speculates on future directions in the field.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 4
    facet.materialart.
    Unknown
    Mathematical model applied to single-track line scheduling problem in Brazilian railways (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-11-11
    Description: In this paper, a single machine scheduling model is used to schedule trains in order to minimize the total weighted delay time. The railway studied, is composed of a part of two joined railways in Brazil, which belongs to VALE company and to Ferrovia Centro-Atlântica (FCA). This railway is a single-track line composed by single-tracks and it is shared by these railways (VALE and FCA). The trains travel in both directions on this single-track line. These railways have a bottleneck caused by a heavy traffic. Therefore, mathematical equations are developed to determine the shortest time interval admissible between two trains, ensuring that they will not overlap. These equations enable us to simplify the mathematical representation of the problem and define it as a single machine scheduling problem. Later, two single machine scheduling formulations are proposed and analyzed; one based on “Arc-Time-Indexed” variables and other, on “Binary” variables. Each formulation reflects a specific concept on how the variables and parameters are defined and require particular settings and definitions. Extensive computational experiments are performed considering various instances to capture several aspects of practical situations. Based on the results of experiments, these mathematical formulations are evaluated as decision-support tools.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 5
    facet.materialart.
    Unknown
    On the $$L$$ L -approach for generating unconstrained two-dimensional non-guillotine cutting patterns (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-10-26
    Description: Many cutting problems on two- or three-dimensional objects require that the cuts be orthogonal and of guillotine type. However, there are applications in which the cuts must be orthogonal but need not be of guillotine type. In this paper we focus on the latter type of cuts on rectangular bins. We investigate the so-called \(L\) -approach, introduced by Lins et al. (J Oper Res Soc 54:777–789, 2003 ), which has been used to tackle, among others, the pallet loading problem and the two-dimensional unconstrained knapsack problem. This approach concerns a method to generate two \(L\) -shaped pieces from an \(L\) -shaped piece. More recently, Birgin et al. (J Oper Res Soc 63(2):183–200, 2012 ), raised two questions concerning this approach. The first question is whether one may restrict only to cuts on raster points (rather than on all discretization points), without loss in the quality of the solution. We prove that the answer to this question is positive. The second question is whether the \(L\) -approach is an optimal method to solve the unconstrained knapsack problem. We show an instance of the problem for which this approach fails to find an optimum solution.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 6
    facet.materialart.
    Unknown
    Contribution to the parameter elicitation in multicriteria optimization (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-10-16
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 7
    facet.materialart.
    Unknown
    A reliable affine relaxation method for global optimization (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-10-08
    Description: An automatic method for constructing linear relaxations of constrained global optimization problems is proposed. Such a construction is based on affine and interval arithmetics and uses operator overloading. These linear programs have exactly the same numbers of variables and inequality constraints as the given problems. Each equality constraint is replaced by two inequalities. This new procedure for computing reliable bounds and certificates of infeasibility is inserted into a classical branch and bound algorithm based on interval analysis. Extensive computation experiments were made on 74 problems from the COCONUT database with up to 24 variables or 17 constraints; 61 of these were solved, and 30 of them for the first time, with a guaranteed upper bound on the relative error equal to \(10^{-8}\) . Moreover, this sample comprises 39 examples to which the GlobSol algorithm was recently applied finding reliable solutions in 32 cases. The proposed method allows solving 31 of these, and 5 more with a CPU-time not exceeding 2 min.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    Multi-period stochastic optimization problems in transportation management (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-09-26
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Erratum to: Internet shopping with price-sensitive discounts (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-09-09
    Description: In Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014 ), an Internet shopping problem with price-sensitive discounts was introduced, in which a customer wants to buy a given set of products in a given set of Internet shops. This problem is an extension of the original Internet shopping optimization problem (ISOP) presented in Blazewich et al. (Int J Appl Math Comput Sci 20(2):385–390, 2010 ). For each Internet shop, standard prices for the products are given as well as a concave increasing discounting function of the total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Among other results, approximability issues were shortly discussed. This note extends this discussion and corrects a flaw in Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014 ).
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    Competitive location in cognitive radio networks (2014)
    Springer
    In: 4OR
    Details
    Publication Date: 2014-08-20
    Description: The paper addresses the problem of strategic base stations placement in cognitive radio networks. We consider a primary user, operating on the frequency channels of a primary network, and an operator (a leader) facing the competition of a second operator (a follower). These operators are willing to exploit the unused capacity of the primary network and maximize their profits derived from operating the base stations installed and clients served. The leader is aware of the future arrival of the follower, who is able to capture clients by placing its own base stations. It has also to limit the interference power at some measurement points defined by the primary user. We formulate the problem as a bi-level location problem and develop a matheuristic where a mixed integer program derived from the follower’s problem is solved by CPLEX software. We prove that the follower’s problem is NP-hard and the leader’s problem is \(\varSigma _2^P\) -hard. Our computational experiments confirm the value of competition for the strategic planning in cognitive radio networks.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...