Approximation of corner polyhedra with families of intersection cuts

We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner polyhedron up to a constant factor, which depends only on $n$ and not the data or dimension of the corner polyhedron. The literature already contains several results in this direction. In this paper, we use the maximum number of facets of lattice-free sets in a family as a measure of its complexity and precisely characterize the level of complexity of a family required for constant factor approximations. As one of the main results, we show that, for each natural number $n$, a corner polyhedron with $n$ basic integer variables and an arbitrary number of continuous non-basic variables is approximated up to a constant factor by intersection cuts from lattice-free sets with at most $i$ facets if $i> 2^{n-1}$ and that no such approximation is possible if $i \leq 2^{n-1}$. When the approximation factor is allowed to depend on the denominator of the fractional vertex of the linear relaxation of the corner polyhedron, we show that the threshold is $i > n$ versus $i \leq n$. The tools introduced for proving such results are of independent interest for studying intersection cuts

Subtropical Real Root Finding

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients. Then we employ linear programming to heuristically find roots. There is a specialized variant for roots with exclusively positive coordinates, which is of considerable interest for applications in chemistry and systems biology. An implementation of our method combining the computer algebra system Reduce with the linear programming solver Gurobi has been successfully applied to input data originating from established mathematical models used in these areas. We have solved several hundred problems with up to more than 800000 monomials in up to 10 variables with degrees up to 12. Our method has failed due to its incompleteness in less than 8 percent of the cases

On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts

We examine the connections between the classes of cuts in the title. We show that lift-and-project (L&P) cuts from a given disjunction are equivalent to generalized intersection cuts from the family of polyhedra obtained by taking positive combinations of the complements of the inequalities of each term of the disjunction. While L&P cuts from split disjunctions are known to be equivalent to standard intersection cuts (SICs) from the strip obtained by complementing the terms of the split, we show that L&P cuts from more general disjunctions may not be equivalent to any SIC. In particular, we give easily verifiable necessary and sufficient conditions for a L&P cut from a given disjunction D to be equivalent to a SIC from the polyhedral counterpart of D. Irregular L&P cuts, i.e. those that violate these conditions, have interesting properties. For instance, unlike the regular ones, they may cut off part of the corner polyhedron associated with the LP solution from which they are derived. Furthermore, they are not exceptional: their frequency exceeds that of regular cuts. A numerical example illustrates some of the above properties. © 2016 Springer-Verlag Berlin Heidelberg and Mathematical Optimization Societ

Markedly Divergent Tree Assemblage Responses to Tropical Forest Loss and Fragmentation across a Strong Seasonality Gradient

We examine the effects of forest fragmentation on the structure and composition of tree assemblages within three seasonal and aseasonal forest types of southern Brazil, including evergreen, Araucaria, and deciduous forests. We sampled three southernmost Atlantic Forest landscapes, including the largest continuous forest protected areas within each forest type. Tree assemblages in each forest type were sampled within 10 plots of 0.1 ha in both continuous forests and 10 adjacent forest fragments. All trees within each plot were assigned to trait categories describing their regeneration strategy, vertical stratification, seed-dispersal mode, seed size, and wood density. We detected differences among both forest types and landscape contexts in terms of overall tree species richness, and the density and species richness of different functional groups in terms of regeneration strategy, seed dispersal mode and woody density. Overall, evergreen forest fragments exhibited the largest deviations from continuous forest plots in assemblage structure. Evergreen, Araucaria and deciduous forests diverge in the functional composition of tree floras, particularly in relation to regeneration strategy and stress tolerance. By supporting a more diversified light-demanding and stress-tolerant flora with reduced richness and abundance of shade-tolerant, old-growth species, both deciduous and Araucaria forest tree assemblages are more intrinsically resilient to contemporary human-disturbances, including fragmentation-induced edge effects, in terms of species erosion and functional shifts. We suggest that these intrinsic differences in the direction and magnitude of responses to changes in landscape structure between forest types should guide a wide range of conservation strategies in restoring fragmented tropical forest landscapes worldwide

Clinical Social Work and the Biomedical Industrial Complex

This article examines how the biomedical industrial complex has ensnared social work within a foreign conceptual and practice model that distracts clinical social workers from the special assistance that they can provide for people with mental distress and misbehavior. We discuss: (1) social work\u27s assimilation of psychiatric perspectives and practices during its pursuit of professional status; (2) the persistence of psychiatric hospitalization despite its coercive methods, high cost, and doubtful efficacy; (3) the increasing reliance on the Diagnostic and Statistical Manual of Mental Disorders, despite its widely acknowledged scientific frailty; and (4) the questionable contributions of psychoactive drugs to clinical mental health outcomes and their vast profits for the pharmaceutical industry, using antipsychotic drugs as a case example. We review a number of promising social work interventions overshadowed by the biomedical approach. We urge social work and other helping professions to exercise intellectual independence from the reigning paternalistic drug-centered biomedical ideology in mental health and to rededicate themselves to the supportive, educative, and problem-solving methods unique to their disciplines

Antiferromagnetic spintronics

Antiferromagnetic materials are magnetic inside, however, the direction of their ordered microscopic moments alternates between individual atomic sites. The resulting zero net magnetic moment makes magnetism in antiferromagnets invisible on the outside. It also implies that if information was stored in antiferromagnetic moments it would be insensitive to disturbing external magnetic fields, and the antiferromagnetic element would not affect magnetically its neighbors no matter how densely the elements were arranged in a device. The intrinsic high frequencies of antiferromagnetic dynamics represent another property that makes antiferromagnets distinct from ferromagnets. The outstanding question is how to efficiently manipulate and detect the magnetic state of an antiferromagnet. In this article we give an overview of recent works addressing this question. We also review studies looking at merits of antiferromagnetic spintronics from a more general perspective of spin-ransport, magnetization dynamics, and materials research, and give a brief outlook of future research and applications of antiferromagnetic spintronics.Comment: 13 pages, 7 figure

Integrality gaps of integer knapsack problems

We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a “typical” knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario

Enhancing the sensitivity of magnetic sensors by 3D metamaterial shells

Magnetic sensors are key elements in our interconnected smart society. Their sensitivity becomes essential for many applications in fields such as biomedicine, computer memories, geophysics, or space exploration. Here we present a universal way of increasing the sensitivity of magnetic sensors by surrounding them with a spherical metamaterial shell with specially designed anisotropic magnetic properties. We analytically demonstrate that the magnetic field in the sensing area is enhanced by our metamaterial shell by a known factor that depends on the shell radii ratio. When the applied field is non-uniform, as for dipolar magnetic field sources, field gradient is increased as well. A proof-of-concept experimental realization confirms the theoretical predictions. The metamaterial shell is also shown to concentrate time-dependent magnetic fields upto frequencies of 100 kHz

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274