Solvable Cases Research Articles

Scheduling a single machine with multiple due dates per job

In this paper, we consider single-machine scheduling with multiple due dates per job. This is motivated by several industrial applications, where it is not important by how much we miss a due date. Instead the relevant objective is to minimize the number of missed due dates. Typically, this situation emerges whenever fixed delivery appointments are chosen in advance, such as in the production of individualized pharmaceuticals or when customers can only receive goods at certain days in the week, due to constraints in their warehouse operation. We compare this previously unexplored problem with classical due date scheduling, for which it is a generalization. We show that single-machine scheduling with multiple due dates is NP-hard in the strong sense if processing times are job dependent. If processing times are equal for all jobs, then single-machine scheduling with multiple due dates is at least as hard as the long-standing open problem of weighted tardiness with equal processing times and release dates 1∣rj,pj=p∣∑wjTj\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$1 \\mid r_j, p_j = p \\mid \\sum w_j T_j$$\\end{document}. Finally, we focus on the case of equal processing times and provide several polynomially solvable special cases as well as an exact branch-and-bound algorithm and heuristics for the general case. Experiments show that our branch-and-bound algorithm compares well to modern exact methods to solve problem 1∣rj,pj=p∣∑wjTj\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$1 \\mid r_j, p_j = p \\mid \\sum w_{j} T_{j}$$\\end{document}.

∂∂¯\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\partial \\bar{\\partial }$$\\end{document}-lemma and p-Kähler structures on families of solvmanifolds

We provide families of compact (n+1)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$(n + 1)$$\\end{document}-dimensional complex non Kähler manifolds satisfying the ∂∂¯\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\partial \\bar{\\partial }$$\\end{document}-Lemma, with holomorphically trivial canonical bundle, carrying a balanced metric and with no p-Kähler structures. Such a construction extends to the completely solvable case in any dimension Nakamura’s construction of low-dimensional holomorphically parallelizable solvmanifolds.

Exact and parameterized algorithms for the independent cutset problem

The Independent Cutset problem asks whether there is a set of vertices in a given graph that is both independent and a cutset. This problem is ▪-complete even when the input graph is planar and has maximum degree five. We first present a O⁎(1.4423n)-time algorithm to compute a minimum independent cutset (if any). Since the property of having an independent cutset is MSO1-expressible, our main results are concerned with structural parameterizations for the problem considering parameters incomparable with clique-width. We present ▪-time algorithms under the following parameters: the dual of the maximum degree, the dual of the solution size, the size of a dominating set (where a dominating set is given as an additional input), the size of an odd cycle transversal, the distance to chordal graphs, and the distance to P5-free graphs. We close by introducing the notion of α-domination, which generalizes key ideas of this article.

Quasinormal modes and the analytical continuation of non-self-adjoint operators

We briefly review the analytical continuation method for determining quasinormal modes (QNMs) and the associated frequencies in open systems. We explore two exactly solvable cases based on the Pöschl–Teller potential to show that the analytical continuation method cannot determine the full set of QNMs and frequencies of a given problem starting from the associated bound state problem in quantum mechanics. The root of the problem is that many QNMs are the analytically continued counterparts of solutions that do not belong to the domain where the associated Schrödinger operator is self-adjoint, challenging the application of the method for determining full sets of QNMs. We illustrate these problems through the physically relevant case of BTZ black holes, where the natural domain of the problem is the negative real line.

Polynomial‐exponential equations — Some new cases of solvability

AbstractRecently, Brownawell and the second author proved a ‘non‐degenerate’ case of the (unproved) ‘Zilber Nullstellensatz’ in connexion with ‘Strong Exponential Closure’. Here, we treat some significant new cases. In particular, these settle completely the problem of solving polynomial‐exponential equations in two complex variables. The methods of proof are also new, as is the consequence, for example, that there are infinitely many complex with .

Weakly anelliptical traveltime analysis: Ambiguity between subsurface and elasticity

The building of a subsurface and (anisotropic) velocity model from a single gather of reflection traveltime (kinematic) data is inherently ambiguous because the processing of such data can only determine a horizontal slowness component, not a vertical one. Based thereon, I derive a simple algorithm that generates an infinite series of combinations of the subsurface-velocity models, all of which will show nearly the same seismic kinematic response, as further demonstrated by simulating wave propagation through a model with different interface dips. This algorithm assumes, first, that all interface dips remain constant over the distance considered and, second, that an approximation of the elasticity model — that is, the linearization of a phase velocity — valid for weak anisotropy can be used. Furthermore, when applied to the classic and analytically solvable case of traveltime analysis for a stack of flat layers with weak transverse isotropy, the algorithm theoretically explains the combination of anisotropy parameters that govern the nonhyperbolic term of a traveltime series: the established [Formula: see text] and its new counterpart [Formula: see text] for a [Formula: see text] and [Formula: see text] wave, respectively.

Vacuum instability in QED with an asymmetric x step: New example of an exactly solvable case

We present a new exactly solvable case in strong-field QED with a one-dimensional step potential (x-step). The corresponding x-step is given by an analytic asymmetric with respect to the axis x reflection function. The step can be considered as a certain analytic “deformation” of the symmetric Sauter field. Moreover, it can be treated as a new regularization of the Klein step field. We study the vacuum instability caused by this x-step in the framework of a nonperturbative approach to strong-field QED. Exact solutions of the Dirac equation used in the corresponding nonperturbative calculations are represented in the form of stationary plane waves with special left and right asymptotics and identified as components of initial and final wave packets of particles. We show that in spite of the fact that the symmetry with respect to positive and negative bands of energies is broken, the distribution of created pairs and other physical quantities can be expressed via elementary functions. We consider the processes of transmission and reflection in the ranges of the stable vacuum and study physical quantities specifying the vacuum instability. We find the differential mean numbers of electron-positron pairs created from the vacuum, the components of current density and energy-momentum tensor of the created electrons and positrons leaving the area of the strong field under consideration. Besides, we study the particular case of the particle creation due to a weakly inhomogeneous electric field and obtain explicitly the total number, the current density and energy-momentum tensor of created particles. Unlike the symmetric case of the Sauter field the asymmetric form of the field under consideration causes the energy density and longitudinal pressure of created electrons to be not equal to the energy density and longitudinal pressure of created positrons. Published by the American Physical Society 2024

Cutting a tree with subgraph complementation is hard, except for some small trees

AbstractFor a graph property , Subgraph Complementation to is the problem to find whether there is a subset of vertices of the input graph such that modifying by complementing the subgraph induced by results in a graph satisfying the property . We prove that the problem of Subgraph Complementation to ‐free graphs is NP‐Complete, for being a tree, except for 41 trees of at most 13 vertices (a graph is ‐free if it does not contain any induced copies of ). This result, along with the four known polynomial‐time solvable cases (when is a path on at most four vertices), leaves behind 37 open cases. Further, we prove that these hard problems do not admit any subexponential‐time algorithms, assuming the Exponential‐Time Hypothesis. As an additional result, we obtain that Subgraph Complementation to paw‐free graphs can be solved in polynomial‐time.

On conflict-free cuts: Algorithms and complexity

One way to define the Matching Cut problem is: Given a graph G, is there an edge-cut M of G such that M is an independent set in the line graph of G? We propose the more general Conflict-Free Cut problem: Together with the graph G, we are given a so-called conflict graph Gˆ on the edges of G, and we ask for an edge-cutset M of G that is independent in Gˆ. Since conflict-free settings are popular generalizations of classical optimization problems and Conflict-Free Cut was not considered in the literature so far, we start the study of the problem. We show that the problem is NP-complete even when the maximum degree of G is 5 and Gˆ is 1-regular. The same reduction implies an exponential lower bound on the solvability based on the Exponential Time Hypothesis. We also give parameterized complexity results: We show that the problem is fixed-parameter tractable with the vertex cover number of G as a parameter, and we show W[1]-hardness even when G has a feedback vertex set of size one, and the clique cover number of Gˆ is the parameter. Since the clique cover number of Gˆ is an upper bound on the independence number of Gˆ and thus the solution size, this implies W[1]-hardness when parameterized by the cut size. We list polynomial-time solvable cases and interesting open problems. At last, we draw a connection to a symmetric variant of SAT.

An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements

An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements

Equitable colorings of ��-corona products of cubic graphs

A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equitable chromatic number of G and it is denoted by x=( G). In this paper the problem of determining the value of equitable chromatic number for multicoronas of cubic graphs G◦ lH is studied. The problem of ordinary coloring of multicoronas of cubic graphs is solvable in polynomial time. The complexity of equitable coloring problem is an open question for these graphs. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use at most x=( G◦ lH) + 1 colors in the remaining cases.

A Framework for Data-Driven Explainability in Mathematical Optimization

Advancements in mathematical programming have made it possible to efficiently tackle large-scale real-world problems that were deemed intractable just a few decades ago. However, provably optimal solutions may not be accepted due to the perception of optimization software as a black box. Although well understood by scientists, this lacks easy accessibility for practitioners. Hence, we advocate for introducing the explainability of a solution as another evaluation criterion, next to its objective value, which enables us to find trade-off solutions between these two criteria. Explainability is attained by comparing against (not necessarily optimal) solutions that were implemented in similar situations in the past. Thus, solutions are preferred that exhibit similar features. Although we prove that already in simple cases the explainable model is NP-hard, we characterize relevant polynomially solvable cases such as the explainable shortest path problem. Our numerical experiments on both artificial as well as real-world road networks show the resulting Pareto front. It turns out that the cost of enforcing explainability can be very small.

Single-hole spectra of Kitaev spin liquids: from dynamical Nagaoka ferromagnetism to spin-hole fractionalization

The dynamical response of a quantum spin liquid upon injecting a hole is a pertinent open question. In experiments, the hole spectral function, measured momentum-resolved in angle-resolved photoemission spectroscopy (ARPES) or locally in scanning tunneling microscopy (STM), can be used to identify spin liquid materials. In this study, we employ tensor network methods to simulate the time evolution of a single hole doped into the Kitaev spin-liquid ground state. Focusing on the gapped spin liquid phase, we reveal two fundamentally different scenarios. For ferromagnetic spin couplings, the spin liquid is highly susceptible to hole doping: a Nagaoka ferromagnet forms dynamically around the doped hole, even at weak coupling. By contrast, in the case of antiferromagnetic spin couplings, the hole spectrum demonstrates an intricate interplay between charge, spin, and flux degrees of freedom, best described by a parton mean-field ansatz of fractionalized holons and spinons. Moreover, we find a good agreement of our numerical results to the analytically solvable case of slow holes. Our results demonstrate that dynamical hole spectral functions provide rich information on the structure of fractionalized quantum spin liquids.

PMSeeker: A Scheme Based on the Greedy Algorithm and the Exhaustive Algorithm to Screen Low-Redundancy Marker Sets for Large-Scale Parentage Assignment with Full Parental Genotyping.

Parentage assignment is a genetic test that utilizes genetic characteristics, such as molecular markers, to identify the parental relationships within populations, which, in commercial fish farming, are almost always large and where full information on potential parents is known. To accurately find the true parents, the genotypes of all loci in the parentage marker set (PMS) are required for each individual being tested. With the same accuracy, a PMS containing a smaller number of markers will undoubtedly save experimental costs. Thus, this study established a scheme to screen low-redundancy PMSs using the exhaustive algorithm and greedy algorithm. When screening PMSs, the greedy algorithm selects markers based on the parental dispersity index (PDI), a uniquely defined metric that outperforms the probability of exclusion (PE). With the conjunctive use of the two algorithms, non-redundant PMSs were found for more than 99.7% of solvable cases in three groups of random sample experiments in this study. Then, a low-redundancy PMS can be composed using two or more of these non-redundant PMSs. This scheme effectively reduces the number of markers in PMSs, thus conserving human and experimental resources and laying the groundwork for the widespread implementation of parentage assignment technology in economic species breeding.

On the Existence of Pure, Broadband Toroidal Sources in Electrodynamics

AbstractMultipoles are paramount for describing electromagnetic fields in many areas of nanoscale optics, playing an essential role in the design of devices in plasmonics and all‐dielectric nanophotonics. Challenging the traditional division into electric and magnetic moments, toroidal moments are proposed as a physically distinct family of multipoles with significant contributions to the properties of matter. However, the apparent impossibility of separately measuring their response sheds doubt on their true physical significance. Here, the possibility of selectively exciting toroidal moments is confirmed without any other multipole. A set of general conditions is developed that any current distribution must fulfill to be entirely described by toroidal moments and prove the results in an analytically solvable case. The new theory allows to design and verify experimentally an artificial structure supporting a pure broadband toroidal dipole response in the complete absence of the electric dipole and other “ordinary” multipole contributions. In addition, a structure capable of supporting a novel type of non‐radiating source is proposed‐ a “toroidal anapole,” originating from the destructive interference of the toroidal dipole with the unconventional electromagnetic sources known as mean square radii. The results in this work provide conclusive evidence on the independent excitation of toroidal moments in electrodynamics.

Reissner–Nordström black holes in quintic quasi-topological gravity

This paper investigates charged black holes within the framework of quintic quasi-topological gravity, focusing on their thermodynamics, conserved quantities, and stability. We construct numerical solutions and explore their thermodynamic properties, supplemented by the study of analytically solvable special cases. By verifying the first law of thermodynamics, we validate our approach and compare our findings to those of Einstein gravity. The physical properties of the solutions are examined across anti-de Sitter, de Sitter, and flat spacetime backgrounds. Our analysis reveals that anti-de Sitter solutions demonstrate thermal stability, while de Sitter and flat solutions lack this property. Finally, we discuss the implications of our results and propose potential avenues for future research in this field.

Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems

The Hamiltonian cycle and path problems are fundamental in graph theory and useful in modelling real-life problems. Research in this area is directed toward designing better and better algorithms for general problems, but also toward defining new special cases for which exact polynomial-time algorithms exist. In the paper, such new classes of digraphs are proposed. The classes include, among others, quasi-adjoint graphs, which are a superclass of adjoints, directed line graphs, and graphs modelling a DNA sequencing problem.

The price-elastic knapsack problem

This paper introduces the price-elastic knapsack problem (PEKP), an extension of the classic knapsack problem where instead of fixed item characteristics, the weight of each item and the profit from including an item in the knapsack are a function of a parameter, namely the price. PEKP is first formulated as a generic nonlinear optimization problem and three special cases are investigated. First, we show a polynomial-time solvable case. Next, we formulate the case where the item weights are affine-linear functions as a quadratic program. The computational results show that solving the quadratic program to optimality is computationally challenging, and thus, an approach that decomposes the problem into three mixed integer programs is proposed. Similarly, the case where the weights of the items are piecewise-linear functions is investigated and a quadratic formulation is proposed. A solution approach based on decomposing the problem into three mixed integer programs that are solved independently is also proposed. Using randomly generated instances of varying sizes, the computational results show that the proposed decomposition leads to significant computational advantages compared to solving the quadratic program in the cases of affine-linear and piecewise-linear functions.

Anomalous dimensions of the Smoluchowski coagulation equation.

The coagulation (or aggregation) equationwas introduced by Smoluchowski in 1916 to describe the clumping together of colloidal particles through diffusion, but has been used in many different contexts as diverse as physical chemistry, chemical engineering, atmospheric physics, planetary science, and economics. The effectiveness of clumping is described by a kernel K(x,y), which depends on the sizes of the colliding particles x,y. We consider kernels K=(xy)^{γ}, but any homogeneous function can be treated using our methods. For sufficiently effective clumping 1≥γ>1/2, the coagulation equationproduces an infinitely large cluster in finite time (a process known as the gel transition). Using a combination of analytical methods and numerics, we calculate the anomalous scaling dimensions of the main cluster growth. Apart from the solution branch which originates from the exactly solvable case γ=1, we find a branch of solutions near γ=1/2, which violates matching conditions for the limit of small cluster sizes, widely believed to hold on a universal basis.

The complexity of the timetable‐based railway network design problem

AbstractBecause of the long planning periods and their long life cycle, railway infrastructure has to be outlined long ahead. At the present, the infrastructure is designed while only little about the intended operation is known. Hence, the timetable and the operation are adjusted to the infrastructure. Since space, time and money for extension measures of railway infrastructure are limited, each modification has to be done carefully and long lasting and should be appropriate for the future unknown demand. To take this into account, we present the robust network design problem for railway infrastructure under capacity constraints and uncertain timetables. Here, we plan the required expansion measures for an uncertain long‐term timetable. We show that this problem is NP‐hard even when restricted to bipartite graphs and very simple timetables and present easier solvable special cases. This problem corresponds to the fixed‐charge network design problem where the expansion costs are minimized such that the timetable is conductible. We model this problem by an integer linear program using time expanded networks. To incorporate the uncertainty of the future timetable, we use a scenario‐based approach. We define scenarios with individual departure and arrival times and optional trains. The network is then optimized such that a given percentage of the scenarios can be operated while minimizing the expansion costs and potential penalty costs for not scheduled optional trains.