Idealness of k-wise intersecting families. [PDF]
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc +1 more source
Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities
There was an elegant expression for the volume of hypercube $[0,1]^n$ clipped by a hyperplane. We generalize the formula to the case of more than one hyperplane.
Cho, Yunhi, Kim, Seonhwa
core
Genetic Algorithm Based Time Schedule Management for Small Aerospace Companies [PDF]
Time schedule management is a really up-to-date problem considering the opposite interests of the employers and employees in the working hours. In order to maximize the profit employers are tend to overload their workers, which leads to exhaustion and ...
Bicsák György
core +1 more source
Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems [PDF]
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and ...
Corominas Subias, Albert +1 more
core
A ranking model for the greedy algorithm and discrete convexity [PDF]
Britta Peis, Ulrich Faigle, Walter Kern
core +4 more sources
Reservation table scheduling : branch-and-bound based optimization vs. integer linear programming techniques [PDF]
Cherroun, Hadda +2 more
core +1 more source
A nearly optimal randomized algorithm for explorable heap selection. [PDF]
Borst S +3 more
europepmc +1 more source
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. [PDF]
Gaar E +4 more
europepmc +1 more source
Related searches:
Quasi-Popular Matchings, Optimality, and Extended Formulations
Mathematics of Operations Research, 2022Yuri Faenza, Telikepalli Kavitha
exaly
The Running Intersection Relaxation of the Multilinear Polytope
Mathematics of Operations Research, 2021Alberto Del Pia, Aida Khajavirad
exaly

