GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (227)
Document type
  • Articles  (227)
Source
Publisher
Years
Journal
Topic
  • 1
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    facet.materialart.
    Unknown
    Springer
    In: 4OR
    Publication Date: 2018-03-05
    Description: This is the traditional triennial note used by the editors to give the readers of 4OR information on the state of the journal and its future. In the 3 years that have passed since the last editorial note (Liberti et al. in Q J Oper 13:1–13, 2015 ), three volumes (each containing four issues) of the journal have been published: vol. 13 (2015), vol. 14 (2016), and vol. 15 (2017).
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    facet.materialart.
    Unknown
    Springer
    In: 4OR
    Publication Date: 2018-03-05
    Description: In this paper, we study a vector scheduling problem with rejection on a single machine, in which each job is characterized by a d -dimension vector and a penalty, in the sense that, jobs can be either rejected by paying a certain penalty or assigned to the machine. The objective is to minimize the sum of the maximum load over all dimensions of the total vector of all accepted jobs, and the total penalty of rejected jobs. We prove that the problem is NP-hard and design two approximation algorithms running in polynomial time. When d is a fixed constant, we present a fully polynomial time approximation scheme.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2018-03-05
    Description: In this paper we analyze an inter-temporal optimization problem of a representative firm that invests in horizontal and vertical innovations and that faces a constraint with respect to total R&D spending. We find that there can exist two different steady-states of the economy when the amount of research spending falls short of an endogenously determined threshold: one with higher productivities and less new technologies being developed, and the other with more technologies being created and lower productivities. But, for a higher amount of R&D spending the steady-state becomes unique and the firm produces the whole spectrum of available technologies. Thus, a lock-in effect may arise that, however, can be overcome by raising R&D spending sufficiently.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2018-03-05
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2018-03-05
    Description: In this study, we deal with the problem of short-term transportation outsourcing for transshipment centers. The carrier needs to determine the numbers of outsourced and self-run trips for the different types of transportation tasks. Stochastic demands which are likely to occur in actual operation are considered. Different trip numbers need to be determined in sequence, so a two-stage stochastic programming technique is applied to formulate the problem. Two models are developed based upon practical considerations to help determine the optimal transportation outsourcing plan. A case study regarding the operations of a logistics carrier in Taiwan is performed. Several tests are also performed considering the number of demand scenarios, optimality gaps, variations in demands, outsourcing cost variations, and problem dimensions in order to better understand the performance of the two models.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2018-03-05
    Description: This paper investigates the coordination problem of a supply chain (SC) composed of a manufacturer exhibiting corporate social responsibility (CSR) and a retailer faced with random demand. The random demand is made up of the multiplication of price-dependent demand and random demand factor (RDF), plus the CSR-dependent demand. The centralized decision problem of the SC is an extension of the existing price setting newsvendor problem (PSNP). It is found that the sufficient condition for the quasi-concavity of expected profit (EP) on PSNP can not ensure the quasi-concavity of EP of the SC. Then, the concavity condition of EP related to the CSR effect factor is presented in the case of uniformly distributed RDF and linear demand in price, and the concavity of EP is proven under centralized decision. For decentralized decision under manufacturer’s Stackelberg game, the manufacturer determines wholesale price and its CSR investment, and then the retailer decides the order quantity and the retail price. The standard revenue-sharing (RS) contract is found not able to coordinate the SC, so a modified RS (MRS) contract is proposed to coordinate the SC. Finally, numerical examples illustrate the validity of the theoretical analysis and the coordination effectiveness of the MRS contract via Matlab.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2018-03-05
    Description: Interior point methods usually rely on iterative methods to solve the linear systems of large scale problems. The paper proposes a hybrid strategy using groups for the preconditioning of these iterative methods. The objective is to solve large scale linear programming problems more efficiently by a faster and robust computation of the preconditioner. In these problems, the coefficient matrix of the linear system becomes ill conditioned during the interior point iterations, causing numerical difficulties to find a solution, mainly with iterative methods. Therefore, the use of preconditioners is a mandatory requirement to achieve successful results. The paper proposes the use of a new columns ordering for the splitting preconditioner computation, exploring the sparsity of the original matrix and the concepts of groups. This new preconditioner is designed specially for the final interior point iterations; a hybrid approach with the controlled Cholesky factorization preconditioner is adopted. Case studies show that the proposed methodology reduces the computational times with the same quality of solutions when compared to previous reference approaches. Furthermore, the benefits are obtained while preserving the sparse structure of the systems. These results highlight the suitability of the proposed approach for large scale problems.
    Print ISSN: 1619-4500
    Electronic ISSN: 1614-2411
    Topics: Mathematics
    Published by Springer
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...