Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models

In this paper we study the problem of minimizing weighted earliness and tardiness on a single machine when all the jobs share the same due date. We propose two quadratic integer programming models for solving both cases of unrestricted and restricted due dates, an auxiliary model based on unconstrained quadratic integer programming and an algorithmic scheme for solving each instance, according to its size and characteristics, in the most efficient way. The scheme is tested on a set of well-known test problems. By combining the solutions of the three models we prove the optimality of the solutions obtained for most of the problems. For large instances, although optimality cannot be proved, we actually obtain optimal solutions for all the tested instances.     

A note on a Mar?enko-Pastur type theorem for time series

In this note we develop an extension of the Mar?enko-Pastur theorem to time series model with temporal correlations. The limiting spectral distribution (LSD) of the sample covariance matrix is characterised by an explicit equation for its Stieltjes transform depending on the spectral density of the time series. A numerical algorithm is then given to compute the density functions of these LSD’s.     

A note on the rates of convergence for weighted sums of ρ * -mixing random variables

We discuss the rates of convergence for weighted sums of ρ ^? -mixing random variables. We solve an open problem posed by Sung [S.H. Sung, On the strong convergence for weighted sums of ρ ^? -mixing random variables, Stat. Pap., 54:773–781, 2013]. In addition, the two obtained lemmas in this paper improve the corresponding ones of Sung in the above-mentioned paper and [S.H. Sung, On the strong convergence for weighted sums of random variables, Stat. Pap., 52:447–454, 2011].     

A note on the event horizon for a processor sharing queue

In this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey (Queueing Syst. 53(1–2), 19–30, 2006). If the arrival rate for a processor sharing queue has unbounded growth over time, then it is possible for the number of customers in a processor sharing queue to grow so quickly that a newly entering job never finishes. We define the minimum size for such a job to be the event horizon for a processor sharing queue. We discuss the use of such a concept and develop some of its properties. This short article serves both as errata for Hampshire, Harchol-Balter and Massey (Queueing Syst. 53(1–2), 19–30, 2006) and as documentation of a characteristic feature for some processor sharing queues with time varying rates.     

A note on “Reguralizers for structured sparsity”

In this note, the notion of admissible sets contained in the strictly positive orthant introduced in Micchelli et al. (Adv. Comp. Math. 38(3), 455–489 2013) is analyzed. This notion was used to generalize theoretical results and optimization methods for structured sparsity. Unfortunately, we will prove that there is no generalization using admissible sets.     

A time discretization scheme of a characteristics method for a fluid–rigid system with discontinuous density

We propose a new characteristics method for the time discretization of a fluid–rigid system in the case when the densities of the fluid and the solid are different. This method is based on a global weak formulation involving only terms defined on the whole fluid–rigid domain. The main idea is to construct a characteristic function which preserves the rigidity of the solid at the discrete time levels. A convergence result for this semi-discrete scheme is then given.     

A note on a very recent paper “Feedback control for nonlinear evolutionary equations with applications”

In this note we correct and improve the proofs of the main lemmas in a very recent publication (Zeng, 2022), in which the hypotheses of boundedness, coerciveness and relaxed monotonicity for the operators are considered.     

Higher-order time integration with a local Lax–Wendroff procedure for a central scheme on an overlapping grid

We have implemented a high-order Lax–Wendroff type time integration for a central scheme on an overlapping grid for conservation law problems. Using a local iterative approach presented by Dumbser et al. (JCP, 2008) [12], we extend a local high-order spatial reconstruction on each cell to a local higher-order space–time polynomial on the cell. We rewrite the central scheme in a fully discrete form to avoid volume integration in the space–time domain. The fluxes at cell interfaces are calculated directly via integrating a higher-order space–time reconstruction of the flux. We compare this approach with the corresponding multi-stage Runge–Kutta time integration (RK). Numerical results show that the new time integration is more cost-effective.     

A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for routing problems with time windows

We propose lifted versions of the Miller–Tucker–Zemlin subtour elimination constraints for routing problems with time windows (TW). The constraints are valid for problems such as the travelling salesman problem with TW, the vehicle routing problem with TW, the generalized travelling salesman problem with TW, and the general vehicle routing problem with TW. They are corrected versions of the constraints proposed by Desrochers and Laporte (1991).     

A note on “branch-and-price approach for the multi-skill project scheduling problem”

In a recent paper published in Optimization Letters, Montoya et al. (Optim Lett 8:1721–1734, 2014) proposed a branch-and-price approach for a multi-skill project scheduling problem. In that paper, an integer linear programming formulation was first introduced which, unfortunately, has a number of inconsistences. At the interest of mathematical rigor, in this note, we refine such formulation.     

A note on self-normalized Dickey-Fuller test for unit root in autoregressive time series with GARCH errors

In this article, the unit root test for AR（p） model with GARCH errors is considered. The Dickey-Fuller test statistics are rewritten in the form of self-normalized sums, and the asymptotic distribution of the test statistics is derived under the weak conditions.     

A Reply to a Note on the Paper “A Simplified Novel Technique for Solving Fully Fuzzy Linear Programming Problems”

This note tries to answer issues raised in Bhardwaj and Kumar (J Optim Theory Appl 163(2): 685–696, 2014). The research summarizes that the results obtained in Khan et al. (J Optim Theory Appl 159: 536–546, 2013) are sound and correct and it fulfills all the necessary requirements of its scope and objectives.     

A Note on the Paper “A Simplified Novel Technique for Solving Fully Fuzzy Linear Programming Problems”

In this note, it is shown that there is error in the existing technique (Khan, I.U., Ahmad, T., Maan, N: A simplified novel technique for solving fully fuzzy linear programming problems. J. Optim. Theory Appl. 159:536–546, 2013).     

A note on “well-posedness theory for hyperbolic conservation laws”

In this note, we generalize the recent result on L¹ well-posedness theory for strictly hyperbolic conservation laws to the nonstrictly hyperbolic system of conservation laws whose characteristics are with constant multiplicity.     

A note on “Methods for constructing distance matrices and the inverse eigenvalue problem”

In this paper, a symmetric nonnegative matrix with zero diagonal and given spectrum, where exactly one of the eigenvalues is positive, is constructed. This solves the symmetric nonnegative eigenvalue problem (SNIEP) for such a spectrum. The construction is based on the idea from the paper Hayden, Reams, Wells, “Methods for constructing distance matrices and the inverse eigenvalue problem”. Some results of this paper are enhanced. The construction is applied for the solution of the inverse eigenvalue problem for Euclidean distance matrices, under some assumptions on the eigenvalues.     

A note on “a dual-ascent approach to the fixed-charge capacitated network design problem”

We show by a counterexample that the dual-ascent procedure proposed by Herrmann, Ioannou, Minis and Proth in a 1996 issue of the European Journal of Operational Research is incorrect in the sense that it does not generate a valid lower bound to the optimal value of fixed-charge capacitated network design problems. We provide a correct dual-ascent procedure based on the same ideas and we give an interpretation of it in terms of a simple Lagrangean relaxation. Although correct, this procedure is not effective, as in general, it provides a less tighter bound than the linear programming relaxation.