The following pages link to Manoel B. Campêlo (Q1392563):
Displaying 42 items.
- (Q263198) (redirect page) (← links)
- The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- A computational study of global algorithms for linear bilevel programming (Q596661) (← links)
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points (Q817135) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
- A note on a penalty function approach for solving bilevel linear programs (Q1580432) (← links)
- A note on a modified simplex approach for solving bilevel linear programming problems (Q1584801) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- On optimal \(k\)-fold colorings of webs and antiwebs (Q1759864) (← links)
- (Q1781862) (redirect page) (← links)
- A study of local solutions in linear bilevel programming (Q1781863) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- A compact quadratic model and linearizations for the minimum linear arrangement problem (Q2091791) (← links)
- The geodesic classification problem on graphs (Q2132333) (← links)
- The generalized dependency constrained spanning tree problem (Q2132411) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- Facets of the polytope of legal sequences (Q2413144) (← links)
- Minimum linear arrangements (Q2413151) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- Integer programming approaches to the multiple team formation problem (Q2668786) (← links)
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- Correction to: ``Using the minimum maximum flow degree to approximate the flow coloring problem'' (Q2675740) (← links)
- (Q2741478) (← links)
- (Q2741499) (← links)
- (Q2768048) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- A New Facet Generating Procedure for the Stable Set Polytope (Q2840706) (← links)
- A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
- (Q3439702) (← links)
- On Lifting Integer Variables in Minimal Inequalities (Q3569810) (← links)
- A parallel lagrangian heuristic for the fractional chromatic number of a graph (Q6050634) (← links)
- Two dependency constrained spanning tree problems (Q6067892) (← links)
- Heuristics for the connected assignment problem in arrays (Q6092548) (← links)
- A strongly polynomial algorithm for the minimum maximum flow degree problem (Q6161285) (← links)
