The following pages link to Miguel Fragoso Constantino (Q613662):
Displaying 33 items.
- (Q319375) (redirect page) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
- Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions (Q458969) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Modeling forest core area with integer programming (Q666471) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- (Q868447) (redirect page) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
- A polyhedral approach to a production planning problem (Q1593522) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- Forest harvest scheduling with clearcut and core area constraints (Q1686506) (← links)
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939) (← links)
- A multi-objective Monte Carlo tree search for forest harvest scheduling (Q2286904) (← links)
- New insights on integer-programming models for the kidney exchange problem (Q2356206) (← links)
- Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study (Q2757525) (← links)
- (Q2759918) (← links)
- A compact formulation of a mixed-integer set (Q2786320) (← links)
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability (Q2862159) (← links)
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions (Q3392190) (← links)
- Robust Models for the Kidney Exchange Problem (Q5085462) (← links)
- Imposing Connectivity Constraints in Forest Planning Models (Q5166249) (← links)
- (Q5477436) (← links)
- Dissimilar arc routing problems (Q6496354) (← links)
- Road network, landing location, and routing optimization for forest smallholders landscapes (Q6659117) (← links)
