"Convex Quadratic Programming Approach to the Maximum Matching Problem."

Domingos M. Cardoso (2001)

> Home

Details and statistics

DOI: 10.1023/A:1011276123981

access: closed

type: Journal Article

metadata version: 2020-09-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgo/Cardoso01b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/Cardoso01b
Domingos M. Cardoso:
Convex Quadratic Programming Approach to the Maximum Matching Problem. J. Glob. Optim. 19(3): 291-306 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.