Results 31 to 40 of about 350,522 (285)
Valid inequalities based on the interpolation procedure [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dash, Sanjeeb, Günlük, Oktay
openaire +1 more source
Scatter Search Algorithm for a Waste Collection Problem in an Argentine Case Study
Increasing urbanization and rising consumption rates are putting pressure on urban systems to efficiently manage Municipal Solid Waste (MSW). Waste collection, in particular, is one of the most challenging aspects of MSW management. Therefore, developing
Diego Rossit +3 more
doaj +1 more source
We present O(n2)an integer linear formulation that uses the so-called “distance variables” to solve the quadratic assignment problem (QAP). The formulation performs particularly well for problems with Manhattan distance matrices.
Serigne Gueye, Philippe Michelon
doaj +1 more source
Efficient logistics management is critical in the modern global supply chain, and this study introduces an advanced hyperheuristic approach to the Multi-Echelon Hub and Routing Optimization (MEHRO) problem.
Kassem Danach +3 more
doaj +1 more source
Estimates for capacities and traces of potentials
It is shown that isoperimetric inequalities, relating measures and capacities, hold for all sets in ℝn if they are valid for all balls. As a corollary, the necessary and sufficient conditions for the continuity of some imbeddings of M. Riesz and Bessel
V. G. Maz'ja, S. P. Preobrazenskii
doaj +1 more source
Inequalities for low-energy symmetric nuclear matter [PDF]
Using effective field theory we prove inequalities for the correlations of two-nucleon operators in low-energy symmetric nuclear matter. For physical values of operator coefficients in the effective Lagrangian, the S = 1, I = 0 channel correlations must ...
C. Vafa +4 more
core +1 more source
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP.
Mounira Groiez +3 more
doaj +1 more source
Two-Term Disjunctions on the Second-Order Cone
Balas introduced disjunctive cuts in the 1970s for mixed-integer linear programs. Several recent papers have attempted to extend this work to mixed-integer conic programs.
Kilinc-Karzan, Fatma, Yildiz, Sercan
core +1 more source
Exact methods for the longest induced cycle problem
The longest induced (or chordless) cycle problem is a graph problem classified as NP-complete and involves the task of determining the largest possible subset of vertices within a graph in such a way that the induced subgraph forms a cycle.
Ahmad Turki Anaqreh +2 more
doaj +1 more source
Notes to G. Bennett’s problems
G. Bennett showed, by elementary proof, that if p≤q then (1.1) holds, and the constant p/s is best possible; and if p≥q then (1.2) is valid. The reversed inequalities have remained open problems.
L. Leindler
doaj +1 more source

