Results 61 to 70 of about 790 (89)
Intersection cuts from multiple rows: a disjunctive programming approach
EURO Journal on Computational Optimization, 2013 We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming.
Egon Balas, Andrea Qualizza
doaj
Matroid bases with cardinality constraints on the intersection. [PDF]
Math Program, 2022 Lendl S, Peis B, Timmermans V.
europepmc +1 more source
A technique for obtaining true approximations for k-center with covering constraints. [PDF]
Math Program, 2022 Anegg G +3 more
europepmc +1 more source
Sink location to find optimal shelters in evacuation planning
EURO Journal on Computational Optimization, 2016 The sink location problem is a combination of network flow and location problems: from a given set of nodes in a flow network a minimum cost subset W has to be selected such that given supplies can be transported to the nodes in W.
P. Heßler, H.W. Hamacher
doaj
Fiduciary Responsibility and the Green Energy Act, 2009 (Ontario, Canada). [PDF]
Environ Justice, 2021 Tsuji SRJ.
europepmc +1 more source
Convex-Concave fitting to successively updated data and its application to covid-19 analysis. [PDF]
J Comb Optim, 2022 Davos DE, Demetriou IC.
europepmc +1 more source
EURO Journal on Computational Optimization, 2017 The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila +3 more
doaj
A duality based 2-approximation algorithm for maximum agreement forest. [PDF]
Math Program, 2023 Olver N +4 more
europepmc +1 more source
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. [PDF]
Math Program, 2022 Bruggmann S, Zenklusen R.
europepmc +1 more source
EURO Journal on Computational Optimization, 2018 Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms.
Christian Artigues +2 more
doaj