English
Related papers

Related papers: On the Hamilton-Waterloo Problem with a single fac…

200 papers

Resource scheduling is critical in many industries, especially in power systems. The Unit Commitment problem determines the on/off status and output levels of generators under many constraints. Traditional exact methods, such as…

Systems and Control · Electrical Eng. & Systems 2025-11-04 Tyler Christeson , Md Habib Ullah , Ali Arabnya , Amin Khodaei , Rui Fan

Tensor decomposition plays a key role in identifying common features across a collection of matrices in many areas of science. A fundamental need in big data research is to process data tabulated as large-scale matrices using eigenvectors.…

Computational Engineering, Finance, and Science · Computer Science 2016-05-24 HyungSeon Oh

We propose an exact polynomial algorithm for a resource allocation problem with convex costs and constraints on partial sums of resource consumptions, in the presence of either continuous or integer variables. No assumption of strict…

Data Structures and Algorithms · Computer Science 2014-04-29 Thibaut Vidal , Patrick Jaillet , Nelson Maculan

We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an $n$-vertex complete graph that needs to be inferred from noisy edge measurements. The measurements are independent and…

Discrete Mathematics · Computer Science 2018-04-18 Vivek Bagaria , Jian Ding , David Tse , Yihong Wu , Jiaming Xu

The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k$-valent infinite circulant graph has a two-way-infinite…

Combinatorics · Mathematics 2017-01-31 Darryn Bryant , Sarada Herke , Barbara Maenhaut , Bridget Webb

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a…

Data Structures and Algorithms · Computer Science 2015-12-18 Victoria Horan , Steve Adachi , Stanley Bak

This paper introduces nonlinear fractional Lane-Emden equations of the form, $$ D^{\alpha} y(x) + \frac{\lambda}{x^\beta}~ D^{\beta} y(x) + f(y) =0, ~ ~1 < \alpha \leq 2, ~~ 0< \beta \leq 1, ~~ 0 < x < 1,$$ subject to boundary conditions,…

Numerical Analysis · Mathematics 2024-08-21 Narendra Kumar , Lok Nath Kannaujiya , Amit K. Verma

This paper reconsiders finite variable reductions of the universal Whitham hierarchy of genus zero in the perspective of dispersionless Hirota equations. In the case of one-variable reduction, dispersionless Hirota equations turn out to be…

Exactly Solvable and Integrable Systems · Physics 2009-11-13 Kanehisa Takasaki , Takashi Takebe

This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs are given a geometric semantics using cubical areas, for which…

Logic in Computer Science · Computer Science 2015-05-18 Thibaut Balabonski , Emmanuel Haucourt

In this paper, we study the hard uniform capacitated $k$- median problem using local search heuristic. Obtaining a constant factor approximation for the \ckm problem is open. All the existing solutions giving constant-factor approximation,…

Data Structures and Algorithms · Computer Science 2018-04-25 Neelima Gupta , Aditya Pancholi

The Schrieffer-Wolff transformation (SWT) is an important perturbative method in quantum mechanics used to simplify Hamiltonians by decoupling low- and high-energy subspaces. Existing methods for implementing the SWT often lack general…

Quantum Physics · Physics 2025-06-19 Leander Reascos , Giovanni Francesco Diotallevi , Mónica Benito

The generalized Oberwolfach problem asks for a factorization of the complete graph $K_v$ into prescribed $2$-factors and at most a $1$-factor. When all $2$-factors are pairwise isomorphic and $v$ is odd, we have the classic Oberwolfach…

Combinatorics · Mathematics 2023-07-24 Peter Danziger , Eric Mendelsohn , Brett Stevens , Tommaso Traetta

We study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer $k$, how many ways are there to assign $k$ variables to 1 (and the others to 0)…

Computational Complexity · Computer Science 2026-04-29 Panagiotis Aivasiliotis , Andreas Göbel , Marc Roth

The Homotopy Perturbation Method (HPM) is used to solve the Burgers-Huxley non-linear differential equations. Three case study problems of Burgers-Huxley are solved using the HPM and the exact solutions are obtained. The rapid convergence…

General Mathematics · Mathematics 2015-03-27 S. Salman Nourazar , Mohsen Soori , Akbar Nazari-Golshan

We provide a complete resolution to the question of compactness for the full solution sets of the fourth-order and sixth-order constant $Q$-curvature problems on smooth closed Riemannian manifolds not conformally diffeomorphic to the…

Analysis of PDEs · Mathematics 2025-09-22 Liuwei Gong , Seunghyeok Kim , Juncheng Wei

Hydro unit commitment is the problem of maximizing water use efficiency while minimizing start-up costs in the daily operation of multiple hydro plants, subject to constraints on short-term reservoir operation, and long-term goals. A…

Optimization and Control · Mathematics 2017-11-17 M. Paredes , L. S. A. Martins

Reductions of the KP-Whitham system, namely the (2+1)-dimensional hydrodynamic system of five equations that describes the slow modulations of periodic solutions of the Kadomtsev-Petviashvili (KP) equation, are studied. Specifically, the…

Exactly Solvable and Integrable Systems · Physics 2020-08-26 Gino Biondini , Mark A. Hoefer , A. Moro

Suppose that $c,d,\alpha,\beta$ are real numbers satisfying the inequalities $1<d<c<79/71$ and $1<\alpha<\beta<6^{1-d/c}$. In this paper, it is proved that, for sufficiently large real numbers $N_1$ and $N_2$ subject to $\alpha\leqslant…

Number Theory · Mathematics 2026-04-21 Linji Long , Jinjiang Li , Min Zhang , Rui Sun

In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…

Logic in Computer Science · Computer Science 2025-10-14 Andrei A. Bulatov , Amirhossein Kazeminia

The Harten-Lax-van Leer with contact (HLLC) scheme is known to be plagued by various forms of numerical shock instabilities. In this paper, we propose a new framework for developing shock stable, contact and shear preserving approximate…

Computational Physics · Physics 2018-03-14 Simon Sangeeth , J. C Mandal
‹ Prev 1 8 9 10 Next ›