The following pages link to Agostinho Agra (Q266034):
Displayed 50 items.
- Implicit cover inequalities (Q266036) (← links)
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
- A maritime inventory routing problem with stochastic sailing and port times (Q337582) (← links)
- The robust vehicle routing problem with time windows (Q340242) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Item:Q266034 (redirect page) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- A MIP based local search heuristic for a stochastic maritime inventory routing problem (Q1680065) (← links)
- MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem (Q1694325) (← links)
- Combined ship routing and inventory management in the salmon farming industry (Q1695779) (← links)
- Comparing techniques for modelling uncertainty in a maritime inventory routing problem (Q1740492) (← links)
- The design of transparent optical networks minimizing the impact of critical nodes (Q1742217) (← links)
- A hybrid heuristic for a stochastic production-inventory-routing problem (Q1742254) (← links)
- Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
- A new branch and bound method for a discrete truss topology design problem (Q1938912) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey (Q2158003) (← links)
- Robust inventory theory with perishable products (Q2158637) (← links)
- An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times (Q2239892) (← links)
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (Q2242202) (← links)
- Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Discrete time and continuous time formulations for a short sea inventory routing problem (Q2358148) (← links)
- Facets for the single node fixed-charge network set with a node set-up variable (Q2448216) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- Hybrid heuristics for a short sea inventory routing problem (Q2514744) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
- A compact formulation of a mixed-integer set (Q2786320) (← links)
- A maritime inventory routing problem: Discrete time formulations and valid inequalities (Q2811316) (← links)
- A Dynamic Programming Approach for a Class of Robust Optimization Problems (Q2817842) (← links)
- Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)
- On the Weight-Constrained Minimum Spanning Tree Problem (Q3091497) (← links)
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows (Q3167629) (← links)
- (Q3178032) (← links)
- An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem (Q4687210) (← links)
- Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem (Q4995096) (← links)
- Feasibility check for the distance geometry problem: an application to molecular conformations (Q5364068) (← links)
- (Q5477436) (← links)
- Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes (Q6066057) (← links)
- Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks (Q6139366) (← links)
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
- A robust model for the lot-sizing problem with uncertain demands (Q6166060) (← links)
- Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model (Q6187236) (← links)