Results 41 to 50 of about 132 (51)

Volume of Hypercubes Clipped by Hyperplanes and Combinatorial Identities

, 2017
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  

D.C. Optimization methods for minimum maximal flow problem [PDF]

, 2004
This paper is concerned with the minimum maximal flow problem, i.e., a problem of minimizing the flow value attained by a maximal flow for agiven network.
Yamamoto Yoshitsugu, Zenke Daisuke, 山本 芳嗣   +2 more
core  

Genetic Algorithm Based Time Schedule Management for Small Aerospace Companies [PDF]

, 2015
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

Machine Learning to Balance the Load in Parallel Branch-and-Bound [PDF]

, 2014
We describe in this paper a new approach to parallelize branch-and-bound on a certain number of processors. We propose to split the optimization of the original problem into the optimization of several subproblems that can be optimized separately with ...
Louveaux, Quentin, Marcos Alvarez, Alejandro, Wehenkel, Louis   +2 more
core  

A ranking model for the greedy algorithm and discrete convexity [PDF]

, 2010
Britta Peis, Ulrich Faigle, Walter Kern
core   +1 more source

A nearly optimal randomized algorithm for explorable heap selection. [PDF]

Math Program
Borst S, Dadush D, Huiberts S, Kashaev D.   +3 more
europepmc   +1 more source

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. [PDF]

Math Program
Gaar E, Lee J, Ljubić I, Sinnl M, Tanınmış K.   +4 more
europepmc   +1 more source

A Column Generation Approach for Solving the Patient Admission Scheduling Problem [PDF]

, 2013
Larsen, Jesper, Lusby, Richard Martin, Range, Troels Martin   +2 more
core   +2 more sources

Reservation table scheduling : branch-and-bound based optimization vs. integer linear programming techniques [PDF]

, 2007
Cherroun, Hadda, Darte, Alain, Feautrier, Paul   +2 more
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On vertex denominators of the Boolean quadric polytope relaxation

, 2015
We study the Mn and Mn,3 relaxations of the boolean quadric polytope BQPn. Corresponding via the covariance mapping cut polytope relaxations are known as the rooted semimetric and metric polytopes.
A. Nikolaev
semanticscholar   +1 more source