Searching for optimal integer solutions to set partitioning problems using column generation

We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the integer properties of the columns formed. In our approach we aim to generate the columns forming the optimal integer solution while simultaneously solving the LP relaxation. By this we can remove column generation in the branch and bound search. The basis is a subgradient technique applied to a Lagrangian dual formulation of the set partitioning problem extended with an additional surrogate constraint. This extra constraint is not relaxed and is used to better control the subgradient evaluations. The column generation is then directed, via the multipliers, to construct columns that form feasible integer solutions. Computational experiments show that we can generate the optimal integer columns in a large set of well known test problems as compared to both standard and stabilized column generation and simultaneously keep the number of columns smaller than standard column generation

A stabilized finite element method for the mixed wave equation in an ALE framework with application to diphthong production

The archived file is not the final published version of the article. © (2016) S. Hirzel Verlag/European Acoustics Association The definitive publisher-authenticated version is available online at http://www.ingentaconnect.com/contentone/dav/aaua/2016/00000102/00000001/art00012 Readers must contact the publisher for reprint or permission to use the material in any form.Working with the wave equation in mixed rather than irreducible form allows one to directly account for both, the acoustic pressure field and the acoustic particle velocity field. Indeed, this becomes the natural option in many problems, such as those involving waves propagating in moving domains, because the equations can easily be set in an arbitrary Lagrangian-Eulerian (ALE) frame of reference. Yet, when attempting a standard Galerkin finite element solution (FEM) for them, it turns out that an inf-sup compatibility constraint has to be satisfied, which prevents from using equal interpolations for the approximated acoustic pressure and velocity fields. In this work it is proposed to resort to a subgrid scale stabilization strategy to circumvent this condition and thus facilitate code implementation. As a possible application, we address the generation of diphthongs in voice production.Peer ReviewedPostprint (author's final draft

Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol

At an airport a series of assignment problems need to be solved before aircraft can arrive and depart and passengers can embark and disembark. A lot of different parties are involved with this, each of which having to plan their own schedule. Two of the assignment problems that the \u27Regie\u27 at Amsterdam Airport Schiphol (AAS) is responsible for, are the gate assignment problem (i.e. where to place which aircraft) and the bus assignment problem (i.e. which bus will transport which passengers to or from the aircraft). Currently these two problems are solved in a sequential fashion, the output of the gate assignment problem is used as input for the bus assignment problem. We look at integrating these two sequential problems into one larger problem that considers both problems at the same time. This creates the possibility of using information regarding the bus assignment problem while solving the gate assignment problem. We developed a column generation algorithm for this problem and have implemented a prototype. To make the algorithm efficient we used a special technique called stabilized column generation and also column deletion. Computational experiments with real-life data from AAS indicate that our algorithm is able to compute a planning for one day at Schiphol in a reasonable time

Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy

The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints. However, CSP has the typical structure that allows application of the renowned Benders’ decomposition method: once the “complicating” binary variables are fixed, the problem decomposes into a large set of linear subproblems on the “easy” continuous ones. This allows to project away the easy variables, reducing to a master problem in the complicating ones where the value functions of the subproblems are approximated with the standard cutting-plane approach. Hence, Benders’ decomposition suffers from the same drawbacks of the cutting-plane method, i.e., oscillation and slow convergence, compounded with the fact that the master problem is combinatorial. To overcome this drawback we present a stabilized Benders decomposition whose master is restricted to a neighborhood of successful candidates by local branching constraints, which are dynamically adjusted, and even dropped, during the iterations. Our experiments with randomly generated and real-world CSP instances with up to 3600 binary variables, 90M continuous variables and 15M inequality constraints show that our approach is competitive with both the current state-of-the-art (cutting-plane-based) code for cell suppression, and the Benders implementation in CPLEX 12.7. In some instances, stabilized Benders is able to quickly provide a very good solution in less than one minute, while the other approaches were not able to find any feasible solution in one hour.Peer ReviewedPreprin

Generation of isolated attosecond pulses in the far field by spatial filtering with an intense few-cycle mid-infrared laser

We report theoretical calculations of high-order harmonic generation (HHG) of Xe with the inclusion of multi-electron effects and macroscopic propagation of the fundamental and harmonic fields in an ionizing medium. By using the time-frequency analysis we show that the reshaping of the fundamental laser field is responsible for the continuum structure in the HHG spectra. We further suggest a method for obtaining an isolated attosecond pulse (IAP) by using a filter centered on axis to select the harmonics in the far field with different divergence. We also discuss the carrier-envelope-phase dependence of an IAP and the possibility to optimize the yield of the IAP. With the intense few-cycle mid-infrared lasers, this offers a possible method for generating isolated attosecond pulses.Comment: 8 figure

Spin-orbit torque induced dipole skyrmion motion at room temperature

We demonstrate deterministic control of dipole-field-stabilized skyrmions by means of spin-orbit torques arising from heavy transition-metal seed layers. Experiments are performed on amorphous Fe/Gd multilayers that are patterned into wires and exhibit stripe domains and dipole skyrmions at room temperature. We show that while the domain walls and skyrmions are achiral on average due to lack of Dzyaloshinskii-Moriya interactions, the N\'eel-like closure domain walls at each surface are chiral and can couple to spin-orbit torques. The current-induced domain evolutions are reported for different magnetic phases, including disordered stripe domains, coexisting stripes and dipole skyrmions and a closed packed dipole skyrmion lattice. The magnetic textures exhibit motion under current excitations with a current density ~10^8 A/m2. By comparing the motion resulting from magnetic spin textures in Fe/Gd films with different heavy transition-metal interfaces, we confirm spin currents can be used to manipulate achiral dipole skyrmions via spin-orbit torques.Comment: 23 pages, 8 figure