The following pages link to Nelson F. Maculan (Q1096543):
Displayed 50 items.
- (Q320085) (redirect page) (← links)
- A speed and departure time optimization algorithm for the pollution-routing problem (Q320086) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination (Q408445) (← links)
- Discretization orders for protein side chains (Q486406) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) (← links)
- A function to test methods applied to global minimization of potential energy of molecules (Q596673) (← links)
- Using a conic formulation for finding Steiner minimal trees (Q596675) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Telecommunication network capacity design for uncertain demand (Q702479) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- Clifford algebra and the discretizable molecular distance geometry problem (Q888986) (← links)
- An exact algorithm for the stratification problem with proportional allocation (Q968011) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem (Q1001331) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Editorial: Reformulation techniques in mathematical programming (Q1025983) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem (Q1029680) (← links)
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- Characterizing and edge-colouring split-indifference graphs (Q1383379) (← links)
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525) (← links)
- A Boolean penalty method for zero-one nonlinear programming (Q1583688) (← links)
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (Q1593533) (← links)
- The distance polytope for the vertex coloring problem (Q1661874) (← links)
- On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds (Q1689063) (← links)
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
- \(k\)-adaptive routing for the robust network loading problem (Q1742208) (← links)
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (Q1761116) (← links)
- Multi-service multi-facility network design under uncertainty (Q1761754) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- Lagrangean methods for 0-1 quadratic problems (Q1803678) (← links)
- A lower bound for the shortest Hamiltonean path in directed graphs (Q1814249) (← links)
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) (Q1823149) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836) (← links)
- A cycle-based formulation for the distance geometry problem (Q2056892) (← links)
- A green inventory model with the effect of carbon taxation (Q2069252) (← links)
- Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) (Q2131142) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds (Q2198534) (← links)
- A new formulation for the safe set problem on graphs (Q2273688) (← links)