# Journal of Combinatorial Optimization

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1206-1220

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1090-1110

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1034-1044

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1160-1173

*fence*composed of the quadrilaterals bounded by successive bars. A set of bars in the plane, each having one endpoint at the origin, defines an

*umbrella*composed of the triangles bounded by successive bars. Given a collection of bars, we study how to use them to build the fence or the umbrella of maximum total area. We present...

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1134-1141

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1111-1129

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1130-1133

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1221-1240

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1280-1297

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1316-1334

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1045-1060

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1142-1159

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1013-1022

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 979-995

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1298-1315

*Chromatic kernel*(

*CK*) problem: given an $$n$$ n -partite graph (called a chromatic correlation graph) $$G=(V,E)$$ G = ( V , E ) with $$V=V_{1}\bigcup \cdots \bigcup V_{n}$$ V = V 1 ⋃ ⋯ ⋃ V n and each partite set $$V_{i}$$ V i containing a constant number $$\lambda $$ λ of vertices, compute a subgraph $$G[V_{CK}]$$...

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1335-1344

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1269-1279

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1174-1205

*sharp*multi-unit demand. This means that each buyer $$i$$ i wants a specific number $$d_i$$ d i of items; a bundle of size less than $$d_i$$ d i has no value. We consider the objective of setting prices and allocations in order to maximize the total revenue of the market maker. The pricing...

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 1061-1089

Journal of Combinatorial Optimization > 2016 > 31 > 3 > 943-960

*cyclic sequence of big faces*is a cyclic sequence of different faces, each bounded by at least six edges, such that two faces from the sequence are adjacent if and only if they are consecutive in the...